./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:01:29,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:01:29,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:01:29,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:01:29,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:01:29,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:01:29,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:01:29,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:01:29,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:01:29,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:01:29,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:01:29,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:01:29,190 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:01:29,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:01:29,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:01:29,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:01:29,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:01:29,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:01:29,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:01:29,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:01:29,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:01:29,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:01:29,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:01:29,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2025-03-13 22:01:29,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:01:29,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:01:29,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:01:29,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:01:29,399 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:01:29,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-13 22:01:30,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c10a75ba/00b85cc7a99b44fbb4041064875868d8/FLAG53b0cfde3 [2025-03-13 22:01:30,717 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:01:30,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-13 22:01:30,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c10a75ba/00b85cc7a99b44fbb4041064875868d8/FLAG53b0cfde3 [2025-03-13 22:01:31,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c10a75ba/00b85cc7a99b44fbb4041064875868d8 [2025-03-13 22:01:31,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:01:31,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:01:31,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:01:31,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:01:31,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:01:31,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f1f91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31, skipping insertion in model container [2025-03-13 22:01:31,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:01:31,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:01:31,328 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:01:31,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:01:31,395 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:01:31,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31 WrapperNode [2025-03-13 22:01:31,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:01:31,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:01:31,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:01:31,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:01:31,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,425 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-13 22:01:31,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:01:31,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:01:31,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:01:31,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:01:31,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:01:31,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:01:31,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:01:31,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:01:31,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (1/1) ... [2025-03-13 22:01:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:01:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:01:31,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:01:31,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:01:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 22:01:31,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 22:01:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:01:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:01:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:01:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:01:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:01:31,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:01:31,482 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:01:31,556 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:01:31,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:01:31,624 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:01:31,624 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:01:31,624 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:01:31,659 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:01:31,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:01:31 BoogieIcfgContainer [2025-03-13 22:01:31,660 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:01:31,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:01:31,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:01:31,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:01:31,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:01:31" (1/3) ... [2025-03-13 22:01:31,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77aaf3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:01:31, skipping insertion in model container [2025-03-13 22:01:31,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:31" (2/3) ... [2025-03-13 22:01:31,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77aaf3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:01:31, skipping insertion in model container [2025-03-13 22:01:31,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:01:31" (3/3) ... [2025-03-13 22:01:31,670 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-03-13 22:01:31,682 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:01:31,684 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-13 22:01:31,686 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:01:31,729 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:31,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 84 flow [2025-03-13 22:01:31,778 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-13 22:01:31,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:31,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-13 22:01:31,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 40 transitions, 84 flow [2025-03-13 22:01:31,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 84 flow [2025-03-13 22:01:31,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:31,808 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:31,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 22:01:31,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:31,813 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:31,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:31,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:31,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:31,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 22:01:31,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:31,819 INFO L85 PathProgramCache]: Analyzing trace with hash -937087091, now seen corresponding path program 1 times [2025-03-13 22:01:31,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:31,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689634935] [2025-03-13 22:01:31,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:31,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:31,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:31,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:31,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689634935] [2025-03-13 22:01:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689634935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:31,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:31,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:31,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546698807] [2025-03-13 22:01:31,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:31,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:31,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:32,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:32,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:32,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 40 [2025-03-13 22:01:32,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:32,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 40 [2025-03-13 22:01:32,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:32,066 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-13 22:01:32,067 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:01:32,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 0/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 4/40 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-03-13 22:01:32,068 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 6 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-13 22:01:32,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 86 flow [2025-03-13 22:01:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-13 22:01:32,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775 [2025-03-13 22:01:32,079 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 84 flow. Second operand 3 states and 93 transitions. [2025-03-13 22:01:32,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 86 flow [2025-03-13 22:01:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:32,086 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 74 flow [2025-03-13 22:01:32,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-13 22:01:32,092 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-03-13 22:01:32,092 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 74 flow [2025-03-13 22:01:32,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,093 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:01:32,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 22:01:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1868936967, now seen corresponding path program 1 times [2025-03-13 22:01:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037226340] [2025-03-13 22:01:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 22:01:32,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 22:01:32,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:32,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 22:01:32,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 22:01:32,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:32,134 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:32,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-13 22:01:32,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-13 22:01:32,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-13 22:01:32,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-13 22:01:32,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-13 22:01:32,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-13 22:01:32,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:01:32,137 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:32,140 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:32,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:01:32,163 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:32,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 116 flow [2025-03-13 22:01:32,182 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2025-03-13 22:01:32,182 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:01:32,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 67 events. 0/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-03-13 22:01:32,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 53 transitions, 116 flow [2025-03-13 22:01:32,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 53 transitions, 116 flow [2025-03-13 22:01:32,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:32,184 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:32,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-13 22:01:32,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:32,187 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:32,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:32,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:01:32,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash 165287266, now seen corresponding path program 1 times [2025-03-13 22:01:32,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221564759] [2025-03-13 22:01:32,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:32,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221564759] [2025-03-13 22:01:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221564759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995970761] [2025-03-13 22:01:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:32,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:32,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:32,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:32,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 53 [2025-03-13 22:01:32,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:32,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 53 [2025-03-13 22:01:32,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:32,295 INFO L124 PetriNetUnfolderBase]: 6/80 cut-off events. [2025-03-13 22:01:32,296 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-13 22:01:32,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 80 events. 6/80 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 6 based on Foata normal form. 13/91 useless extension candidates. Maximal degree in co-relation 31. Up to 22 conditions per place. [2025-03-13 22:01:32,297 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 9 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-03-13 22:01:32,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 120 flow [2025-03-13 22:01:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-13 22:01:32,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2025-03-13 22:01:32,299 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 116 flow. Second operand 3 states and 122 transitions. [2025-03-13 22:01:32,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 120 flow [2025-03-13 22:01:32,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:32,300 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 102 flow [2025-03-13 22:01:32,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-13 22:01:32,301 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-13 22:01:32,301 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 102 flow [2025-03-13 22:01:32,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,302 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:01:32,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:01:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1200795982, now seen corresponding path program 1 times [2025-03-13 22:01:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286058012] [2025-03-13 22:01:32,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:01:32,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:01:32,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:32,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:01:32,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:01:32,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:32,341 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:32,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-13 22:01:32,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-13 22:01:32,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-13 22:01:32,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-13 22:01:32,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-13 22:01:32,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-13 22:01:32,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-13 22:01:32,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-13 22:01:32,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:01:32,342 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:32,343 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:32,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:01:32,377 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:32,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 150 flow [2025-03-13 22:01:32,399 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-13 22:01:32,400 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:01:32,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 0/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-03-13 22:01:32,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 150 flow [2025-03-13 22:01:32,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 66 transitions, 150 flow [2025-03-13 22:01:32,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:32,402 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:32,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 22:01:32,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:32,405 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:32,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:32,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-13 22:01:32,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1619092452, now seen corresponding path program 1 times [2025-03-13 22:01:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072511102] [2025-03-13 22:01:32,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:32,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:32,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:32,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072511102] [2025-03-13 22:01:32,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072511102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:32,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:32,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631331593] [2025-03-13 22:01:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:32,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:32,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:32,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:32,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 66 [2025-03-13 22:01:32,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:32,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 66 [2025-03-13 22:01:32,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:32,508 INFO L124 PetriNetUnfolderBase]: 42/219 cut-off events. [2025-03-13 22:01:32,509 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-13 22:01:32,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 219 events. 42/219 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 975 event pairs, 42 based on Foata normal form. 40/248 useless extension candidates. Maximal degree in co-relation 112. Up to 85 conditions per place. [2025-03-13 22:01:32,512 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 12 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-13 22:01:32,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 156 flow [2025-03-13 22:01:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-03-13 22:01:32,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7626262626262627 [2025-03-13 22:01:32,513 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 150 flow. Second operand 3 states and 151 transitions. [2025-03-13 22:01:32,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 156 flow [2025-03-13 22:01:32,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 55 transitions, 154 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:32,514 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2025-03-13 22:01:32,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-13 22:01:32,515 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2025-03-13 22:01:32,515 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2025-03-13 22:01:32,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,517 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:01:32,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-13 22:01:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1029731378, now seen corresponding path program 1 times [2025-03-13 22:01:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55299005] [2025-03-13 22:01:32,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:01:32,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:01:32,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:32,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:01:32,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:01:32,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:32,560 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 22:01:32,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 22:01:32,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:01:32,563 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:32,563 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:32,563 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 22:01:32,583 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:32,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 79 transitions, 186 flow [2025-03-13 22:01:32,603 INFO L124 PetriNetUnfolderBase]: 0/107 cut-off events. [2025-03-13 22:01:32,603 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:01:32,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 107 events. 0/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 244 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-03-13 22:01:32,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 79 transitions, 186 flow [2025-03-13 22:01:32,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 79 transitions, 186 flow [2025-03-13 22:01:32,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:32,606 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:32,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:01:32,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:32,607 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:32,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:32,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-13 22:01:32,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash -870638829, now seen corresponding path program 1 times [2025-03-13 22:01:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998299499] [2025-03-13 22:01:32,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:32,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:32,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:32,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998299499] [2025-03-13 22:01:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998299499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:32,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:32,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303075967] [2025-03-13 22:01:32,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:32,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:32,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:32,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:32,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 79 [2025-03-13 22:01:32,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:32,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 79 [2025-03-13 22:01:32,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:32,752 INFO L124 PetriNetUnfolderBase]: 204/680 cut-off events. [2025-03-13 22:01:32,752 INFO L125 PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES. [2025-03-13 22:01:32,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 680 events. 204/680 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4446 event pairs, 204 based on Foata normal form. 121/759 useless extension candidates. Maximal degree in co-relation 348. Up to 328 conditions per place. [2025-03-13 22:01:32,760 INFO L140 encePairwiseOnDemand]: 67/79 looper letters, 15 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-03-13 22:01:32,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 194 flow [2025-03-13 22:01:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-13 22:01:32,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.759493670886076 [2025-03-13 22:01:32,761 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 186 flow. Second operand 3 states and 180 transitions. [2025-03-13 22:01:32,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 194 flow [2025-03-13 22:01:32,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 66 transitions, 188 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:32,763 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 158 flow [2025-03-13 22:01:32,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-03-13 22:01:32,766 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -11 predicate places. [2025-03-13 22:01:32,767 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 158 flow [2025-03-13 22:01:32,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,767 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:01:32,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-13 22:01:32,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash -992367161, now seen corresponding path program 1 times [2025-03-13 22:01:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926994461] [2025-03-13 22:01:32,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 22:01:32,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 22:01:32,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:32,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 22:01:32,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 22:01:32,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:32,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:32,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:32,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:01:32,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:01:32,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:01:32,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:01:32,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:01:32,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:01:32,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-13 22:01:32,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:01:32,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:01:32,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:01:32,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:01:32,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:01:32,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:01:32,811 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:32,812 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:32,812 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 22:01:32,837 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:32,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 92 transitions, 224 flow [2025-03-13 22:01:32,853 INFO L124 PetriNetUnfolderBase]: 0/127 cut-off events. [2025-03-13 22:01:32,853 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 22:01:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 127 events. 0/127 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 321 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-03-13 22:01:32,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 92 transitions, 224 flow [2025-03-13 22:01:32,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 92 transitions, 224 flow [2025-03-13 22:01:32,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:32,856 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:32,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-13 22:01:32,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:32,859 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:32,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:32,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:32,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:32,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-13 22:01:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1286028015, now seen corresponding path program 1 times [2025-03-13 22:01:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072122585] [2025-03-13 22:01:32,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:32,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:32,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:32,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:32,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072122585] [2025-03-13 22:01:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072122585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:32,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:32,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:32,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748728484] [2025-03-13 22:01:32,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:32,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:32,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:32,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:32,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 92 [2025-03-13 22:01:32,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:32,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:32,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 92 [2025-03-13 22:01:32,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:33,150 INFO L124 PetriNetUnfolderBase]: 852/2215 cut-off events. [2025-03-13 22:01:33,150 INFO L125 PetriNetUnfolderBase]: For 1829/1829 co-relation queries the response was YES. [2025-03-13 22:01:33,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 2215 events. 852/2215 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17615 event pairs, 852 based on Foata normal form. 364/2440 useless extension candidates. Maximal degree in co-relation 1208. Up to 1219 conditions per place. [2025-03-13 22:01:33,174 INFO L140 encePairwiseOnDemand]: 78/92 looper letters, 18 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-13 22:01:33,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 77 transitions, 234 flow [2025-03-13 22:01:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-13 22:01:33,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7572463768115942 [2025-03-13 22:01:33,175 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 224 flow. Second operand 3 states and 209 transitions. [2025-03-13 22:01:33,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 77 transitions, 234 flow [2025-03-13 22:01:33,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 77 transitions, 222 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:33,180 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 186 flow [2025-03-13 22:01:33,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2025-03-13 22:01:33,182 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -13 predicate places. [2025-03-13 22:01:33,182 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 186 flow [2025-03-13 22:01:33,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:33,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:33,183 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:33,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:01:33,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-13 22:01:33,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -965411207, now seen corresponding path program 1 times [2025-03-13 22:01:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785932953] [2025-03-13 22:01:33,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:33,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:01:33,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:01:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:33,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:33,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:01:33,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:01:33,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:33,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:33,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:33,229 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:33,229 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-13 22:01:33,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-13 22:01:33,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-13 22:01:33,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-13 22:01:33,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-13 22:01:33,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-13 22:01:33,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-13 22:01:33,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-13 22:01:33,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-13 22:01:33,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-13 22:01:33,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-13 22:01:33,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-13 22:01:33,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-13 22:01:33,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-13 22:01:33,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:01:33,230 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:33,231 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:33,231 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-13 22:01:33,251 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:33,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 264 flow [2025-03-13 22:01:33,262 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2025-03-13 22:01:33,262 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-13 22:01:33,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 147 events. 0/147 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 397 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-03-13 22:01:33,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 105 transitions, 264 flow [2025-03-13 22:01:33,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 105 transitions, 264 flow [2025-03-13 22:01:33,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:33,264 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:33,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:01:33,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:33,265 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:33,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:33,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:33,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:33,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 22:01:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash -500841608, now seen corresponding path program 1 times [2025-03-13 22:01:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:33,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319688439] [2025-03-13 22:01:33,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:33,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:33,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:33,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319688439] [2025-03-13 22:01:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319688439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700120134] [2025-03-13 22:01:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:33,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:33,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:33,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:33,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 105 [2025-03-13 22:01:33,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:33,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:33,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 105 [2025-03-13 22:01:33,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:34,015 INFO L124 PetriNetUnfolderBase]: 3282/7296 cut-off events. [2025-03-13 22:01:34,015 INFO L125 PetriNetUnfolderBase]: For 7882/7882 co-relation queries the response was YES. [2025-03-13 22:01:34,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14052 conditions, 7296 events. 3282/7296 cut-off events. For 7882/7882 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 66480 event pairs, 3282 based on Foata normal form. 1093/7955 useless extension candidates. Maximal degree in co-relation 4201. Up to 4378 conditions per place. [2025-03-13 22:01:34,069 INFO L140 encePairwiseOnDemand]: 89/105 looper letters, 21 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-03-13 22:01:34,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 88 transitions, 276 flow [2025-03-13 22:01:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2025-03-13 22:01:34,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2025-03-13 22:01:34,071 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 264 flow. Second operand 3 states and 238 transitions. [2025-03-13 22:01:34,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 88 transitions, 276 flow [2025-03-13 22:01:34,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 88 transitions, 256 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:34,075 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 214 flow [2025-03-13 22:01:34,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2025-03-13 22:01:34,075 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -15 predicate places. [2025-03-13 22:01:34,075 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 214 flow [2025-03-13 22:01:34,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:34,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:34,076 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:34,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:01:34,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-13 22:01:34,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1040966948, now seen corresponding path program 1 times [2025-03-13 22:01:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:34,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-03-13 22:01:34,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:34,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:01:34,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:01:34,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:34,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:34,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:34,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:01:34,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:01:34,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:34,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:34,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:34,150 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:34,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-13 22:01:34,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:01:34,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:01:34,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:01:34,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:01:34,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:01:34,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:01:34,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:01:34,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:01:34,151 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:34,152 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:34,152 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-13 22:01:34,181 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:34,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 118 transitions, 306 flow [2025-03-13 22:01:34,194 INFO L124 PetriNetUnfolderBase]: 0/167 cut-off events. [2025-03-13 22:01:34,194 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-13 22:01:34,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 167 events. 0/167 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 478 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-03-13 22:01:34,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 118 transitions, 306 flow [2025-03-13 22:01:34,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 118 transitions, 306 flow [2025-03-13 22:01:34,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:34,197 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:34,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-13 22:01:34,198 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:34,198 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:34,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:34,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:34,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:34,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-13 22:01:34,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1936280402, now seen corresponding path program 1 times [2025-03-13 22:01:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:34,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461600915] [2025-03-13 22:01:34,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:34,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:34,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:34,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:34,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461600915] [2025-03-13 22:01:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461600915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:34,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:34,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285954382] [2025-03-13 22:01:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:34,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:34,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:34,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:34,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:34,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 118 [2025-03-13 22:01:34,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 118 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:34,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:34,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 118 [2025-03-13 22:01:34,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:36,300 INFO L124 PetriNetUnfolderBase]: 12030/23987 cut-off events. [2025-03-13 22:01:36,300 INFO L125 PetriNetUnfolderBase]: For 32188/32188 co-relation queries the response was YES. [2025-03-13 22:01:36,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47511 conditions, 23987 events. 12030/23987 cut-off events. For 32188/32188 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 237823 event pairs, 12030 based on Foata normal form. 3280/25944 useless extension candidates. Maximal degree in co-relation 14385. Up to 15313 conditions per place. [2025-03-13 22:01:36,604 INFO L140 encePairwiseOnDemand]: 100/118 looper letters, 24 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-03-13 22:01:36,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 99 transitions, 320 flow [2025-03-13 22:01:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-03-13 22:01:36,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542372881355932 [2025-03-13 22:01:36,610 INFO L175 Difference]: Start difference. First operand has 133 places, 118 transitions, 306 flow. Second operand 3 states and 267 transitions. [2025-03-13 22:01:36,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 99 transitions, 320 flow [2025-03-13 22:01:36,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 99 transitions, 290 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:36,656 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 242 flow [2025-03-13 22:01:36,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2025-03-13 22:01:36,658 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -17 predicate places. [2025-03-13 22:01:36,658 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 242 flow [2025-03-13 22:01:36,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:36,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:36,660 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:36,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:01:36,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-13 22:01:36,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 52381960, now seen corresponding path program 1 times [2025-03-13 22:01:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120005112] [2025-03-13 22:01:36,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:36,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:01:36,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:01:36,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:36,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:36,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:36,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:01:36,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:01:36,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:36,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:36,744 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-13 22:01:36,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-13 22:01:36,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:01:36,746 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:36,746 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:36,746 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-13 22:01:36,792 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:36,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 131 transitions, 350 flow [2025-03-13 22:01:36,808 INFO L124 PetriNetUnfolderBase]: 0/187 cut-off events. [2025-03-13 22:01:36,812 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-13 22:01:36,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 187 events. 0/187 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 550 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2025-03-13 22:01:36,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 131 transitions, 350 flow [2025-03-13 22:01:36,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 131 transitions, 350 flow [2025-03-13 22:01:36,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:36,816 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:36,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-13 22:01:36,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:36,820 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:36,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:36,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:36,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:36,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-13 22:01:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1274678929, now seen corresponding path program 1 times [2025-03-13 22:01:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810339077] [2025-03-13 22:01:36,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:36,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:36,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:36,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:36,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810339077] [2025-03-13 22:01:36,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810339077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:36,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22722593] [2025-03-13 22:01:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:36,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:36,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:36,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:36,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2025-03-13 22:01:36,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 131 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:36,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:36,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2025-03-13 22:01:36,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:43,957 INFO L124 PetriNetUnfolderBase]: 42648/78424 cut-off events. [2025-03-13 22:01:43,957 INFO L125 PetriNetUnfolderBase]: For 126236/126236 co-relation queries the response was YES. [2025-03-13 22:01:44,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158811 conditions, 78424 events. 42648/78424 cut-off events. For 126236/126236 co-relation queries the response was YES. Maximal size of possible extension queue 3426. Compared 829423 event pairs, 42648 based on Foata normal form. 9841/84271 useless extension candidates. Maximal degree in co-relation 48572. Up to 52492 conditions per place. [2025-03-13 22:01:44,675 INFO L140 encePairwiseOnDemand]: 111/131 looper letters, 27 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-03-13 22:01:44,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 110 transitions, 366 flow [2025-03-13 22:01:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-03-13 22:01:44,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7531806615776081 [2025-03-13 22:01:44,676 INFO L175 Difference]: Start difference. First operand has 148 places, 131 transitions, 350 flow. Second operand 3 states and 296 transitions. [2025-03-13 22:01:44,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 110 transitions, 366 flow [2025-03-13 22:01:44,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 110 transitions, 324 flow, removed 21 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:44,726 INFO L231 Difference]: Finished difference. Result has 129 places, 110 transitions, 270 flow [2025-03-13 22:01:44,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=129, PETRI_TRANSITIONS=110} [2025-03-13 22:01:44,727 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -19 predicate places. [2025-03-13 22:01:44,727 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 110 transitions, 270 flow [2025-03-13 22:01:44,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:44,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:44,728 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:44,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:01:44,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-13 22:01:44,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1466527387, now seen corresponding path program 1 times [2025-03-13 22:01:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139140582] [2025-03-13 22:01:44,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:44,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:01:44,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:01:44,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:44,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:44,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:44,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:01:44,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:01:44,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:44,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:44,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:44,761 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:44,761 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-13 22:01:44,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-13 22:01:44,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-13 22:01:44,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-13 22:01:44,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-13 22:01:44,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-13 22:01:44,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-13 22:01:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:01:44,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:44,764 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:44,764 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-03-13 22:01:44,796 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:44,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 144 transitions, 396 flow [2025-03-13 22:01:44,811 INFO L124 PetriNetUnfolderBase]: 0/207 cut-off events. [2025-03-13 22:01:44,812 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-13 22:01:44,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 207 events. 0/207 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 625 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2025-03-13 22:01:44,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 144 transitions, 396 flow [2025-03-13 22:01:44,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 144 transitions, 396 flow [2025-03-13 22:01:44,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:44,815 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:44,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-13 22:01:44,816 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:44,817 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:01:44,817 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:44,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:44,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:44,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 18 more)] === [2025-03-13 22:01:44,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 542101793, now seen corresponding path program 1 times [2025-03-13 22:01:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:44,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407477223] [2025-03-13 22:01:44,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:44,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 22:01:44,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 22:01:44,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:44,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:01:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407477223] [2025-03-13 22:01:44,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407477223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:44,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:44,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860060854] [2025-03-13 22:01:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:44,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:44,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:44,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:44,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:44,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 144 [2025-03-13 22:01:44,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:01:44,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:44,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 144 [2025-03-13 22:01:44,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand