./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-nondet.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-theta/unwind3-nondet.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 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:32:42,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:32:42,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:32:42,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:32:42,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:32:42,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:32:42,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:32:42,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:32:42,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:32:42,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:32:42,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:32:42,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:32:42,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:32:42,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:32:42,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:32:42,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:32:42,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:32:42,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:32:42,355 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 -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2025-03-13 22:32:42,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:32:42,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:32:42,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:32:42,593 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:32:42,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:32:42,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-03-13 22:32:43,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fff6d96/c86645872d0a47c498adc122c85ca143/FLAGd9d7c653f [2025-03-13 22:32:44,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:32:44,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-03-13 22:32:44,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fff6d96/c86645872d0a47c498adc122c85ca143/FLAGd9d7c653f [2025-03-13 22:32:44,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fff6d96/c86645872d0a47c498adc122c85ca143 [2025-03-13 22:32:44,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:32:44,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:32:44,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:32:44,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:32:44,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:32:44,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44, skipping insertion in model container [2025-03-13 22:32:44,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:32:44,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:32:44,618 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:32:44,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:32:44,670 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:32:44,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44 WrapperNode [2025-03-13 22:32:44,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:32:44,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:32:44,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:32:44,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:32:44,677 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:32:44" (1/1) ... [2025-03-13 22:32:44,689 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:32:44" (1/1) ... [2025-03-13 22:32:44,701 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2025-03-13 22:32:44,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:32:44,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:32:44,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:32:44,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:32:44,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:32:44,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:32:44,719 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:32:44,719 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:32:44,719 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (1/1) ... [2025-03-13 22:32:44,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:32:44,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:32:44,744 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:32:44,745 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:32:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:32:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-13 22:32:44,762 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-13 22:32:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-13 22:32:44,762 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-13 22:32:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:32:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:32:44,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:32:44,763 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:32:44,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:32:44,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:32:44,971 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:32:44,971 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:32:44,971 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:32:44,985 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:32:44,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:32:44 BoogieIcfgContainer [2025-03-13 22:32:44,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:32:44,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:32:44,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:32:44,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:32:44,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:32:44" (1/3) ... [2025-03-13 22:32:44,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b956496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:32:44, skipping insertion in model container [2025-03-13 22:32:44,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:32:44" (2/3) ... [2025-03-13 22:32:44,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b956496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:32:44, skipping insertion in model container [2025-03-13 22:32:44,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:32:44" (3/3) ... [2025-03-13 22:32:44,993 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2025-03-13 22:32:45,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:32:45,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-nondet.i that has 3 procedures, 102 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-13 22:32:45,007 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:32:45,069 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:45,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 108 transitions, 224 flow [2025-03-13 22:32:45,160 INFO L124 PetriNetUnfolderBase]: 10/157 cut-off events. [2025-03-13 22:32:45,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:45,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 10/157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 268 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2025-03-13 22:32:45,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 108 transitions, 224 flow [2025-03-13 22:32:45,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 91 transitions, 189 flow [2025-03-13 22:32:45,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:45,189 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:45,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 22:32:45,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:45,195 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:45,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:45,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:45,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:45,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:32:45,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1745959639, now seen corresponding path program 1 times [2025-03-13 22:32:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:45,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269420315] [2025-03-13 22:32:45,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:45,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:45,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:45,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:45,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:45,351 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:32:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:45,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269420315] [2025-03-13 22:32:45,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269420315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:45,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:45,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314573877] [2025-03-13 22:32:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:45,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:45,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:45,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2025-03-13 22:32:45,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:32:45,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:45,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2025-03-13 22:32:45,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:45,479 INFO L124 PetriNetUnfolderBase]: 11/147 cut-off events. [2025-03-13 22:32:45,479 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:32:45,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 147 events. 11/147 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 291 event pairs, 8 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 104. Up to 33 conditions per place. [2025-03-13 22:32:45,481 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 13 selfloop transitions, 2 changer transitions 1/88 dead transitions. [2025-03-13 22:32:45,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 213 flow [2025-03-13 22:32:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-13 22:32:45,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2025-03-13 22:32:45,492 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 189 flow. Second operand 3 states and 279 transitions. [2025-03-13 22:32:45,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 213 flow [2025-03-13 22:32:45,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:45,498 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 184 flow [2025-03-13 22:32:45,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=91, 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=184, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2025-03-13 22:32:45,510 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2025-03-13 22:32:45,510 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 184 flow [2025-03-13 22:32:45,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:32:45,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:45,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:45,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:32:45,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:32:45,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 890061647, now seen corresponding path program 1 times [2025-03-13 22:32:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:45,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-03-13 22:32:45,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:45,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:45,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:45,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:45,552 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:32:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-03-13 22:32:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687802690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071377468] [2025-03-13 22:32:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:45,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:45,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:45,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:45,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 108 [2025-03-13 22:32:45,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:32:45,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:45,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 108 [2025-03-13 22:32:45,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:45,620 INFO L124 PetriNetUnfolderBase]: 7/129 cut-off events. [2025-03-13 22:32:45,620 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:32:45,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 129 events. 7/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 4 based on Foata normal form. 3/124 useless extension candidates. Maximal degree in co-relation 144. Up to 25 conditions per place. [2025-03-13 22:32:45,620 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 11 selfloop transitions, 1 changer transitions 24/82 dead transitions. [2025-03-13 22:32:45,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 202 flow [2025-03-13 22:32:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-03-13 22:32:45,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8271604938271605 [2025-03-13 22:32:45,622 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 184 flow. Second operand 3 states and 268 transitions. [2025-03-13 22:32:45,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 202 flow [2025-03-13 22:32:45,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 82 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:45,624 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 122 flow [2025-03-13 22:32:45,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2025-03-13 22:32:45,624 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -6 predicate places. [2025-03-13 22:32:45,624 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 122 flow [2025-03-13 22:32:45,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:32:45,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:45,625 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:32:45,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:32:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1791617286, now seen corresponding path program 1 times [2025-03-13 22:32:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-03-13 22:32:45,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:45,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:32:45,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:32:45,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:45,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:45,827 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:32:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-03-13 22:32:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354236282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874191593] [2025-03-13 22:32:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:45,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:45,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:45,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:45,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2025-03-13 22:32:45,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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:32:45,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:45,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2025-03-13 22:32:45,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:45,904 INFO L124 PetriNetUnfolderBase]: 2/86 cut-off events. [2025-03-13 22:32:45,904 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:32:45,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 86 events. 2/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 2 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 88. Up to 17 conditions per place. [2025-03-13 22:32:45,905 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 11 selfloop transitions, 2 changer transitions 4/61 dead transitions. [2025-03-13 22:32:45,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 162 flow [2025-03-13 22:32:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2025-03-13 22:32:45,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2025-03-13 22:32:45,907 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 122 flow. Second operand 5 states and 448 transitions. [2025-03-13 22:32:45,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 162 flow [2025-03-13 22:32:45,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:45,909 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 127 flow [2025-03-13 22:32:45,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-03-13 22:32:45,909 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -26 predicate places. [2025-03-13 22:32:45,909 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 127 flow [2025-03-13 22:32:45,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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:32:45,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:45,910 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:45,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:32:45,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:32:45,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:45,911 INFO L85 PathProgramCache]: Analyzing trace with hash 244739749, now seen corresponding path program 1 times [2025-03-13 22:32:45,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:45,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-03-13 22:32:45,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:45,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:32:45,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:32:45,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:45,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:45,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:45,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:32:45,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:32:45,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:45,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:45,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:45,970 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:45,973 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-13 22:32:45,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-13 22:32:45,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:32:45,975 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:45,979 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:45,979 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:32:46,002 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:46,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 308 flow [2025-03-13 22:32:46,030 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2025-03-13 22:32:46,030 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:32:46,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 220 events. 14/220 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 471 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 231. Up to 6 conditions per place. [2025-03-13 22:32:46,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 308 flow [2025-03-13 22:32:46,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 98 transitions, 209 flow [2025-03-13 22:32:46,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:46,033 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:46,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 22:32:46,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:46,035 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:46,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:46,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:46,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:46,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:32:46,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash 510905047, now seen corresponding path program 1 times [2025-03-13 22:32:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:46,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277583815] [2025-03-13 22:32:46,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:46,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:46,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:46,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:46,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:46,063 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:32:46,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:46,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277583815] [2025-03-13 22:32:46,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277583815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:46,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:46,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883442365] [2025-03-13 22:32:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:46,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:46,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:46,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:46,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2025-03-13 22:32:46,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:32:46,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:46,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2025-03-13 22:32:46,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:46,150 INFO L124 PetriNetUnfolderBase]: 38/271 cut-off events. [2025-03-13 22:32:46,150 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-13 22:32:46,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 271 events. 38/271 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 904 event pairs, 34 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 188. Up to 83 conditions per place. [2025-03-13 22:32:46,152 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 15 selfloop transitions, 2 changer transitions 1/95 dead transitions. [2025-03-13 22:32:46,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 237 flow [2025-03-13 22:32:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-13 22:32:46,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2025-03-13 22:32:46,154 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 209 flow. Second operand 3 states and 368 transitions. [2025-03-13 22:32:46,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 237 flow [2025-03-13 22:32:46,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:46,157 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 204 flow [2025-03-13 22:32:46,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-03-13 22:32:46,158 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 0 predicate places. [2025-03-13 22:32:46,159 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 204 flow [2025-03-13 22:32:46,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:32:46,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:46,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:46,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:32:46,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:32:46,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash -672434353, now seen corresponding path program 1 times [2025-03-13 22:32:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-13 22:32:46,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:46,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:46,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:46,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:46,192 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:32:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-13 22:32:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307157604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:46,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699541633] [2025-03-13 22:32:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:46,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:46,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:46,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2025-03-13 22:32:46,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:32:46,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:46,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2025-03-13 22:32:46,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:46,248 INFO L124 PetriNetUnfolderBase]: 26/233 cut-off events. [2025-03-13 22:32:46,249 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 22:32:46,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 233 events. 26/233 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 708 event pairs, 22 based on Foata normal form. 7/223 useless extension candidates. Maximal degree in co-relation 300. Up to 63 conditions per place. [2025-03-13 22:32:46,251 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 13 selfloop transitions, 1 changer transitions 18/89 dead transitions. [2025-03-13 22:32:46,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 226 flow [2025-03-13 22:32:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-03-13 22:32:46,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8125 [2025-03-13 22:32:46,253 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 204 flow. Second operand 3 states and 351 transitions. [2025-03-13 22:32:46,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 89 transitions, 226 flow [2025-03-13 22:32:46,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:46,255 INFO L231 Difference]: Finished difference. Result has 96 places, 71 transitions, 154 flow [2025-03-13 22:32:46,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2025-03-13 22:32:46,257 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -6 predicate places. [2025-03-13 22:32:46,257 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 154 flow [2025-03-13 22:32:46,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:32:46,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:46,257 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:46,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:32:46,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:32:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1932738045, now seen corresponding path program 1 times [2025-03-13 22:32:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827258666] [2025-03-13 22:32:46,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:46,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:32:46,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:32:46,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:46,385 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:32:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827258666] [2025-03-13 22:32:46,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827258666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:46,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:46,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517321044] [2025-03-13 22:32:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:46,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:46,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:46,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:46,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2025-03-13 22:32:46,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 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:32:46,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:46,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2025-03-13 22:32:46,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:46,464 INFO L124 PetriNetUnfolderBase]: 17/181 cut-off events. [2025-03-13 22:32:46,464 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:32:46,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 181 events. 17/181 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 425 event pairs, 17 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 224. Up to 51 conditions per place. [2025-03-13 22:32:46,466 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 13 selfloop transitions, 2 changer transitions 10/75 dead transitions. [2025-03-13 22:32:46,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 204 flow [2025-03-13 22:32:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2025-03-13 22:32:46,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8361111111111111 [2025-03-13 22:32:46,468 INFO L175 Difference]: Start difference. First operand has 96 places, 71 transitions, 154 flow. Second operand 5 states and 602 transitions. [2025-03-13 22:32:46,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 204 flow [2025-03-13 22:32:46,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:46,469 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 149 flow [2025-03-13 22:32:46,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-03-13 22:32:46,470 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -20 predicate places. [2025-03-13 22:32:46,470 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 149 flow [2025-03-13 22:32:46,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 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:32:46,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:46,471 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:46,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:32:46,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:32:46,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash -978731554, now seen corresponding path program 1 times [2025-03-13 22:32:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:46,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453194503] [2025-03-13 22:32:46,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:46,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-13 22:32:46,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-13 22:32:46,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:46,487 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:46,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-13 22:32:46,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-13 22:32:46,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:46,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:46,508 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 22:32:46,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 22:32:46,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:32:46,509 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:46,511 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:46,511 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:32:46,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:46,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 180 transitions, 396 flow [2025-03-13 22:32:46,568 INFO L124 PetriNetUnfolderBase]: 18/283 cut-off events. [2025-03-13 22:32:46,568 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:32:46,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 283 events. 18/283 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 662 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 300. Up to 8 conditions per place. [2025-03-13 22:32:46,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 180 transitions, 396 flow [2025-03-13 22:32:46,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 105 transitions, 231 flow [2025-03-13 22:32:46,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:46,574 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:46,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-13 22:32:46,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:46,575 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:46,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:46,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:46,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:46,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:32:46,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash 40828631, now seen corresponding path program 1 times [2025-03-13 22:32:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077041539] [2025-03-13 22:32:46,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:46,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:46,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:46,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:46,608 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:32:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:46,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077041539] [2025-03-13 22:32:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077041539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:46,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:46,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818313106] [2025-03-13 22:32:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:46,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:46,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:46,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2025-03-13 22:32:46,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:32:46,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:46,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2025-03-13 22:32:46,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:46,719 INFO L124 PetriNetUnfolderBase]: 115/517 cut-off events. [2025-03-13 22:32:46,719 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-13 22:32:46,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 517 events. 115/517 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2359 event pairs, 110 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 384. Up to 207 conditions per place. [2025-03-13 22:32:46,723 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 17 selfloop transitions, 2 changer transitions 1/102 dead transitions. [2025-03-13 22:32:46,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 263 flow [2025-03-13 22:32:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-13 22:32:46,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462962962962963 [2025-03-13 22:32:46,725 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 231 flow. Second operand 3 states and 457 transitions. [2025-03-13 22:32:46,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 263 flow [2025-03-13 22:32:46,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 102 transitions, 260 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:46,727 INFO L231 Difference]: Finished difference. Result has 111 places, 101 transitions, 224 flow [2025-03-13 22:32:46,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=111, PETRI_TRANSITIONS=101} [2025-03-13 22:32:46,728 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2025-03-13 22:32:46,728 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 224 flow [2025-03-13 22:32:46,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:32:46,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:46,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:46,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:32:46,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:32:46,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 595671119, now seen corresponding path program 1 times [2025-03-13 22:32:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022862739] [2025-03-13 22:32:46,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:46,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:46,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:46,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:46,745 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:32:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022862739] [2025-03-13 22:32:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022862739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600051167] [2025-03-13 22:32:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:46,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:46,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:46,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 180 [2025-03-13 22:32:46,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:32:46,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:46,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 180 [2025-03-13 22:32:46,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:46,833 INFO L124 PetriNetUnfolderBase]: 83/435 cut-off events. [2025-03-13 22:32:46,834 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 22:32:46,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 435 events. 83/435 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1875 event pairs, 78 based on Foata normal form. 15/420 useless extension candidates. Maximal degree in co-relation 626. Up to 159 conditions per place. [2025-03-13 22:32:46,836 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 15 selfloop transitions, 1 changer transitions 18/96 dead transitions. [2025-03-13 22:32:46,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 96 transitions, 250 flow [2025-03-13 22:32:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2025-03-13 22:32:46,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8037037037037037 [2025-03-13 22:32:46,838 INFO L175 Difference]: Start difference. First operand has 111 places, 101 transitions, 224 flow. Second operand 3 states and 434 transitions. [2025-03-13 22:32:46,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 96 transitions, 250 flow [2025-03-13 22:32:46,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 96 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:46,840 INFO L231 Difference]: Finished difference. Result has 105 places, 78 transitions, 174 flow [2025-03-13 22:32:46,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=105, PETRI_TRANSITIONS=78} [2025-03-13 22:32:46,840 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2025-03-13 22:32:46,840 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 78 transitions, 174 flow [2025-03-13 22:32:46,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:32:46,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:46,842 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:46,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:32:46,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:32:46,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash 641114357, now seen corresponding path program 1 times [2025-03-13 22:32:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:46,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699071362] [2025-03-13 22:32:46,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:46,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-13 22:32:46,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 22:32:46,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:46,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:46,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:32:46,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699071362] [2025-03-13 22:32:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699071362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296094067] [2025-03-13 22:32:46,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:46,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:46,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:47,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2025-03-13 22:32:47,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 78 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 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:32:47,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:47,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2025-03-13 22:32:47,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:47,061 INFO L124 PetriNetUnfolderBase]: 61/332 cut-off events. [2025-03-13 22:32:47,061 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-13 22:32:47,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 332 events. 61/332 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1196 event pairs, 61 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 463. Up to 127 conditions per place. [2025-03-13 22:32:47,063 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 15 selfloop transitions, 2 changer transitions 10/82 dead transitions. [2025-03-13 22:32:47,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 82 transitions, 228 flow [2025-03-13 22:32:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 754 transitions. [2025-03-13 22:32:47,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8377777777777777 [2025-03-13 22:32:47,065 INFO L175 Difference]: Start difference. First operand has 105 places, 78 transitions, 174 flow. Second operand 5 states and 754 transitions. [2025-03-13 22:32:47,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 82 transitions, 228 flow [2025-03-13 22:32:47,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 82 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:47,067 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 169 flow [2025-03-13 22:32:47,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2025-03-13 22:32:47,068 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -20 predicate places. [2025-03-13 22:32:47,068 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 169 flow [2025-03-13 22:32:47,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 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:32:47,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:47,069 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:32:47,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:32:47,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1792904484, now seen corresponding path program 1 times [2025-03-13 22:32:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400878363] [2025-03-13 22:32:47,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:47,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 22:32:47,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 22:32:47,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:47,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:47,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 22:32:47,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 22:32:47,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:47,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:47,117 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-13 22:32:47,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-13 22:32:47,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:32:47,118 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:47,118 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:47,118 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 22:32:47,152 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:47,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 216 transitions, 488 flow [2025-03-13 22:32:47,174 INFO L124 PetriNetUnfolderBase]: 22/346 cut-off events. [2025-03-13 22:32:47,174 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:32:47,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 346 events. 22/346 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 870 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 370. Up to 10 conditions per place. [2025-03-13 22:32:47,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 216 transitions, 488 flow [2025-03-13 22:32:47,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 255 flow [2025-03-13 22:32:47,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:47,179 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:47,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:32:47,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:47,181 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:47,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:47,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:47,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:47,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:32:47,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash 335730391, now seen corresponding path program 1 times [2025-03-13 22:32:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:47,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544295376] [2025-03-13 22:32:47,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:47,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:47,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:47,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:47,208 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:32:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544295376] [2025-03-13 22:32:47,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544295376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:47,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:47,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:47,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691881056] [2025-03-13 22:32:47,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:47,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:47,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:47,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 216 [2025-03-13 22:32:47,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:32:47,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:47,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 216 [2025-03-13 22:32:47,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:47,364 INFO L124 PetriNetUnfolderBase]: 316/1031 cut-off events. [2025-03-13 22:32:47,364 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-03-13 22:32:47,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1031 events. 316/1031 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5801 event pairs, 310 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 835. Up to 503 conditions per place. [2025-03-13 22:32:47,375 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 19 selfloop transitions, 2 changer transitions 1/109 dead transitions. [2025-03-13 22:32:47,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 109 transitions, 291 flow [2025-03-13 22:32:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2025-03-13 22:32:47,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2025-03-13 22:32:47,377 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 255 flow. Second operand 3 states and 546 transitions. [2025-03-13 22:32:47,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 109 transitions, 291 flow [2025-03-13 22:32:47,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 109 transitions, 284 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:47,381 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 244 flow [2025-03-13 22:32:47,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2025-03-13 22:32:47,382 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-03-13 22:32:47,382 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 244 flow [2025-03-13 22:32:47,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:32:47,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:47,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:47,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:32:47,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:32:47,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:47,383 INFO L85 PathProgramCache]: Analyzing trace with hash 399410767, now seen corresponding path program 1 times [2025-03-13 22:32:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:47,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487168638] [2025-03-13 22:32:47,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:47,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:47,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:47,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:47,400 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:32:47,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:47,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487168638] [2025-03-13 22:32:47,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487168638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:47,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:47,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:47,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403833643] [2025-03-13 22:32:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:47,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:47,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:47,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:47,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:47,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 216 [2025-03-13 22:32:47,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:32:47,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:47,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 216 [2025-03-13 22:32:47,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:47,538 INFO L124 PetriNetUnfolderBase]: 236/853 cut-off events. [2025-03-13 22:32:47,538 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-13 22:32:47,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 853 events. 236/853 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4554 event pairs, 230 based on Foata normal form. 31/837 useless extension candidates. Maximal degree in co-relation 1332. Up to 391 conditions per place. [2025-03-13 22:32:47,543 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 17 selfloop transitions, 1 changer transitions 18/103 dead transitions. [2025-03-13 22:32:47,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 103 transitions, 274 flow [2025-03-13 22:32:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2025-03-13 22:32:47,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7978395061728395 [2025-03-13 22:32:47,545 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 244 flow. Second operand 3 states and 517 transitions. [2025-03-13 22:32:47,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 103 transitions, 274 flow [2025-03-13 22:32:47,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 103 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:47,547 INFO L231 Difference]: Finished difference. Result has 114 places, 85 transitions, 194 flow [2025-03-13 22:32:47,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=114, PETRI_TRANSITIONS=85} [2025-03-13 22:32:47,548 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -6 predicate places. [2025-03-13 22:32:47,548 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 85 transitions, 194 flow [2025-03-13 22:32:47,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:32:47,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:47,548 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:47,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:32:47,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:32:47,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1042922224, now seen corresponding path program 1 times [2025-03-13 22:32:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:47,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404910753] [2025-03-13 22:32:47,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:47,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:47,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-13 22:32:47,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-13 22:32:47,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:47,639 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:32:47,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:47,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404910753] [2025-03-13 22:32:47,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404910753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:47,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:47,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:47,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803562024] [2025-03-13 22:32:47,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:47,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:47,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:47,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:47,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2025-03-13 22:32:47,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 85 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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:32:47,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:47,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2025-03-13 22:32:47,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:47,738 INFO L124 PetriNetUnfolderBase]: 181/655 cut-off events. [2025-03-13 22:32:47,738 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-13 22:32:47,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 655 events. 181/655 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3082 event pairs, 181 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 994. Up to 311 conditions per place. [2025-03-13 22:32:47,741 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 17 selfloop transitions, 2 changer transitions 10/89 dead transitions. [2025-03-13 22:32:47,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 89 transitions, 252 flow [2025-03-13 22:32:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 906 transitions. [2025-03-13 22:32:47,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388888888888889 [2025-03-13 22:32:47,743 INFO L175 Difference]: Start difference. First operand has 114 places, 85 transitions, 194 flow. Second operand 5 states and 906 transitions. [2025-03-13 22:32:47,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 89 transitions, 252 flow [2025-03-13 22:32:47,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:47,745 INFO L231 Difference]: Finished difference. Result has 100 places, 79 transitions, 189 flow [2025-03-13 22:32:47,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=100, PETRI_TRANSITIONS=79} [2025-03-13 22:32:47,745 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -20 predicate places. [2025-03-13 22:32:47,745 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 79 transitions, 189 flow [2025-03-13 22:32:47,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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:32:47,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:47,746 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:47,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:32:47,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:32:47,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash 604425183, now seen corresponding path program 1 times [2025-03-13 22:32:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776126014] [2025-03-13 22:32:47,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:47,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:32:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:32:47,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:47,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:47,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:32:47,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:32:47,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:47,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:47,775 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:47,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:32:47,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:32:47,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:32:47,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:32:47,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:32:47,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:32:47,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-03-13 22:32:47,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:32:47,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:32:47,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:32:47,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:32:47,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:32:47,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:32:47,780 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:47,780 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:47,780 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 22:32:47,808 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:47,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 252 transitions, 584 flow [2025-03-13 22:32:47,838 INFO L124 PetriNetUnfolderBase]: 26/409 cut-off events. [2025-03-13 22:32:47,839 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 22:32:47,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 409 events. 26/409 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1058 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 441. Up to 12 conditions per place. [2025-03-13 22:32:47,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 252 transitions, 584 flow [2025-03-13 22:32:47,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 119 transitions, 281 flow [2025-03-13 22:32:47,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:47,842 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:47,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-13 22:32:47,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:47,843 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:47,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:47,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:47,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:47,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:32:47,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:47,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1395610327, now seen corresponding path program 1 times [2025-03-13 22:32:47,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:47,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-03-13 22:32:47,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:47,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:47,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:47,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:47,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:47,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:47,858 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:32:47,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-03-13 22:32:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354634405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:47,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:47,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:47,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849027466] [2025-03-13 22:32:47,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:47,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:47,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:47,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:47,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 252 [2025-03-13 22:32:47,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:32:47,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:47,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 252 [2025-03-13 22:32:47,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:48,113 INFO L124 PetriNetUnfolderBase]: 813/2129 cut-off events. [2025-03-13 22:32:48,113 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-03-13 22:32:48,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 2129 events. 813/2129 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13797 event pairs, 806 based on Foata normal form. 1/2041 useless extension candidates. Maximal degree in co-relation 1830. Up to 1191 conditions per place. [2025-03-13 22:32:48,126 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 21 selfloop transitions, 2 changer transitions 1/116 dead transitions. [2025-03-13 22:32:48,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 116 transitions, 321 flow [2025-03-13 22:32:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-03-13 22:32:48,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83994708994709 [2025-03-13 22:32:48,128 INFO L175 Difference]: Start difference. First operand has 129 places, 119 transitions, 281 flow. Second operand 3 states and 635 transitions. [2025-03-13 22:32:48,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 116 transitions, 321 flow [2025-03-13 22:32:48,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 116 transitions, 308 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:48,129 INFO L231 Difference]: Finished difference. Result has 129 places, 115 transitions, 264 flow [2025-03-13 22:32:48,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=129, PETRI_TRANSITIONS=115} [2025-03-13 22:32:48,130 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2025-03-13 22:32:48,130 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 115 transitions, 264 flow [2025-03-13 22:32:48,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:32:48,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:48,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:48,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:32:48,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:32:48,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:48,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1261215409, now seen corresponding path program 1 times [2025-03-13 22:32:48,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:48,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843189754] [2025-03-13 22:32:48,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:48,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:48,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:48,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:48,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:48,152 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:32:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:48,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843189754] [2025-03-13 22:32:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843189754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:48,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943625680] [2025-03-13 22:32:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:48,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:48,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 252 [2025-03-13 22:32:48,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 115 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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:32:48,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:48,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 252 [2025-03-13 22:32:48,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:48,324 INFO L124 PetriNetUnfolderBase]: 621/1743 cut-off events. [2025-03-13 22:32:48,324 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-13 22:32:48,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 1743 events. 621/1743 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10852 event pairs, 614 based on Foata normal form. 63/1738 useless extension candidates. Maximal degree in co-relation 2878. Up to 935 conditions per place. [2025-03-13 22:32:48,335 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 19 selfloop transitions, 1 changer transitions 18/110 dead transitions. [2025-03-13 22:32:48,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 110 transitions, 298 flow [2025-03-13 22:32:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-03-13 22:32:48,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2025-03-13 22:32:48,337 INFO L175 Difference]: Start difference. First operand has 129 places, 115 transitions, 264 flow. Second operand 3 states and 600 transitions. [2025-03-13 22:32:48,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 110 transitions, 298 flow [2025-03-13 22:32:48,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 110 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:48,339 INFO L231 Difference]: Finished difference. Result has 123 places, 92 transitions, 214 flow [2025-03-13 22:32:48,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=123, PETRI_TRANSITIONS=92} [2025-03-13 22:32:48,340 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, -6 predicate places. [2025-03-13 22:32:48,340 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 92 transitions, 214 flow [2025-03-13 22:32:48,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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:32:48,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:48,340 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:32:48,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:32:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1092521876, now seen corresponding path program 1 times [2025-03-13 22:32:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472726835] [2025-03-13 22:32:48,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:48,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:32:48,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:32:48,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:48,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:48,433 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:32:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472726835] [2025-03-13 22:32:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472726835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:48,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156848148] [2025-03-13 22:32:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:48,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:48,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:48,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:48,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:48,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 252 [2025-03-13 22:32:48,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 92 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 209.2) internal successors, (1046), 5 states have internal predecessors, (1046), 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:32:48,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:48,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 252 [2025-03-13 22:32:48,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:48,581 INFO L124 PetriNetUnfolderBase]: 485/1354 cut-off events. [2025-03-13 22:32:48,581 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-03-13 22:32:48,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1354 events. 485/1354 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7665 event pairs, 485 based on Foata normal form. 1/1354 useless extension candidates. Maximal degree in co-relation 2173. Up to 743 conditions per place. [2025-03-13 22:32:48,591 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 19 selfloop transitions, 2 changer transitions 10/96 dead transitions. [2025-03-13 22:32:48,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 96 transitions, 276 flow [2025-03-13 22:32:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1058 transitions. [2025-03-13 22:32:48,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8396825396825397 [2025-03-13 22:32:48,594 INFO L175 Difference]: Start difference. First operand has 123 places, 92 transitions, 214 flow. Second operand 5 states and 1058 transitions. [2025-03-13 22:32:48,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 96 transitions, 276 flow [2025-03-13 22:32:48,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 96 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:48,596 INFO L231 Difference]: Finished difference. Result has 109 places, 86 transitions, 209 flow [2025-03-13 22:32:48,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=109, PETRI_TRANSITIONS=86} [2025-03-13 22:32:48,596 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, -20 predicate places. [2025-03-13 22:32:48,596 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 86 transitions, 209 flow [2025-03-13 22:32:48,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 209.2) internal successors, (1046), 5 states have internal predecessors, (1046), 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:32:48,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:48,597 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:48,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:32:48,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:32:48,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash -888678617, now seen corresponding path program 1 times [2025-03-13 22:32:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253013173] [2025-03-13 22:32:48,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-13 22:32:48,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-13 22:32:48,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:48,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:48,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:48,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-13 22:32:48,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-13 22:32:48,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:48,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:48,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:48,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:48,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-13 22:32:48,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-13 22:32:48,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:32:48,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:48,632 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:48,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-13 22:32:48,672 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:48,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 288 transitions, 684 flow [2025-03-13 22:32:48,709 INFO L124 PetriNetUnfolderBase]: 30/472 cut-off events. [2025-03-13 22:32:48,709 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-13 22:32:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 472 events. 30/472 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1223 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 513. Up to 14 conditions per place. [2025-03-13 22:32:48,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 288 transitions, 684 flow [2025-03-13 22:32:48,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 309 flow [2025-03-13 22:32:48,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:48,712 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:48,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-13 22:32:48,713 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:48,714 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:48,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:48,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:48,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:48,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-13 22:32:48,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1074498857, now seen corresponding path program 1 times [2025-03-13 22:32:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-03-13 22:32:48,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:48,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:48,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:48,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:48,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:48,730 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:32:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:48,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-03-13 22:32:48,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132867255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:48,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:48,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:48,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540154756] [2025-03-13 22:32:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:48,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:48,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:48,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 288 [2025-03-13 22:32:48,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 126 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:32:48,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:48,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 288 [2025-03-13 22:32:48,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:49,175 INFO L124 PetriNetUnfolderBase]: 1998/4491 cut-off events. [2025-03-13 22:32:49,175 INFO L125 PetriNetUnfolderBase]: For 1165/1165 co-relation queries the response was YES. [2025-03-13 22:32:49,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7898 conditions, 4491 events. 1998/4491 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 31859 event pairs, 1990 based on Foata normal form. 1/4375 useless extension candidates. Maximal degree in co-relation 4009. Up to 2759 conditions per place. [2025-03-13 22:32:49,214 INFO L140 encePairwiseOnDemand]: 283/288 looper letters, 23 selfloop transitions, 2 changer transitions 1/123 dead transitions. [2025-03-13 22:32:49,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 123 transitions, 353 flow [2025-03-13 22:32:49,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-13 22:32:49,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8379629629629629 [2025-03-13 22:32:49,216 INFO L175 Difference]: Start difference. First operand has 138 places, 126 transitions, 309 flow. Second operand 3 states and 724 transitions. [2025-03-13 22:32:49,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 123 transitions, 353 flow [2025-03-13 22:32:49,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 123 transitions, 332 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:49,219 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 284 flow [2025-03-13 22:32:49,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2025-03-13 22:32:49,220 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2025-03-13 22:32:49,220 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 284 flow [2025-03-13 22:32:49,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:32:49,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:49,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:32:49,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-13 22:32:49,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash -91240113, now seen corresponding path program 1 times [2025-03-13 22:32:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825290465] [2025-03-13 22:32:49,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:49,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:49,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:49,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:49,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:49,235 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:32:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:49,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825290465] [2025-03-13 22:32:49,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825290465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:49,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:49,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:49,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333753051] [2025-03-13 22:32:49,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:49,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:49,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:49,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:49,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:49,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 288 [2025-03-13 22:32:49,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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:32:49,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:49,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 288 [2025-03-13 22:32:49,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:49,656 INFO L124 PetriNetUnfolderBase]: 1550/3657 cut-off events. [2025-03-13 22:32:49,656 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-13 22:32:49,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6294 conditions, 3657 events. 1550/3657 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 25099 event pairs, 1542 based on Foata normal form. 127/3691 useless extension candidates. Maximal degree in co-relation 6264. Up to 2183 conditions per place. [2025-03-13 22:32:49,674 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 21 selfloop transitions, 1 changer transitions 18/117 dead transitions. [2025-03-13 22:32:49,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 117 transitions, 322 flow [2025-03-13 22:32:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-03-13 22:32:49,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7905092592592593 [2025-03-13 22:32:49,675 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 284 flow. Second operand 3 states and 683 transitions. [2025-03-13 22:32:49,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 117 transitions, 322 flow [2025-03-13 22:32:49,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:49,677 INFO L231 Difference]: Finished difference. Result has 132 places, 99 transitions, 234 flow [2025-03-13 22:32:49,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=132, PETRI_TRANSITIONS=99} [2025-03-13 22:32:49,677 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -6 predicate places. [2025-03-13 22:32:49,677 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 99 transitions, 234 flow [2025-03-13 22:32:49,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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:32:49,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:49,678 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:49,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:32:49,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-13 22:32:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1171344959, now seen corresponding path program 1 times [2025-03-13 22:32:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511784394] [2025-03-13 22:32:49,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:49,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-13 22:32:49,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-13 22:32:49,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:49,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:49,759 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:32:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511784394] [2025-03-13 22:32:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511784394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260005951] [2025-03-13 22:32:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:49,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:49,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:49,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:49,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 288 [2025-03-13 22:32:49,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 99 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 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:32:49,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:49,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 288 [2025-03-13 22:32:49,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:50,136 INFO L124 PetriNetUnfolderBase]: 1221/2869 cut-off events. [2025-03-13 22:32:50,136 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-03-13 22:32:50,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4808 conditions, 2869 events. 1221/2869 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 18278 event pairs, 1221 based on Foata normal form. 1/2869 useless extension candidates. Maximal degree in co-relation 4776. Up to 1735 conditions per place. [2025-03-13 22:32:50,162 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 21 selfloop transitions, 2 changer transitions 10/103 dead transitions. [2025-03-13 22:32:50,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 103 transitions, 300 flow [2025-03-13 22:32:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1210 transitions. [2025-03-13 22:32:50,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8402777777777778 [2025-03-13 22:32:50,166 INFO L175 Difference]: Start difference. First operand has 132 places, 99 transitions, 234 flow. Second operand 5 states and 1210 transitions. [2025-03-13 22:32:50,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 103 transitions, 300 flow [2025-03-13 22:32:50,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 103 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:50,169 INFO L231 Difference]: Finished difference. Result has 118 places, 93 transitions, 229 flow [2025-03-13 22:32:50,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=112, 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=5, PETRI_FLOW=229, PETRI_PLACES=118, PETRI_TRANSITIONS=93} [2025-03-13 22:32:50,169 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -20 predicate places. [2025-03-13 22:32:50,169 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 93 transitions, 229 flow [2025-03-13 22:32:50,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 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:32:50,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:50,170 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:50,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:32:50,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-13 22:32:50,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 394097396, now seen corresponding path program 1 times [2025-03-13 22:32:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-03-13 22:32:50,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:50,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-13 22:32:50,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 22:32:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:50,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:50,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-13 22:32:50,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 22:32:50,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:50,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:50,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:50,287 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:50,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-13 22:32:50,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-13 22:32:50,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:32:50,289 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:50,290 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:50,290 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-13 22:32:50,347 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:50,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 324 transitions, 788 flow [2025-03-13 22:32:50,387 INFO L124 PetriNetUnfolderBase]: 34/535 cut-off events. [2025-03-13 22:32:50,387 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-13 22:32:50,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 535 events. 34/535 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1452 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 586. Up to 16 conditions per place. [2025-03-13 22:32:50,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 330 places, 324 transitions, 788 flow [2025-03-13 22:32:50,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 133 transitions, 339 flow [2025-03-13 22:32:50,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:50,390 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:50,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-13 22:32:50,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:50,391 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:50,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:50,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:50,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:50,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:32:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1515337431, now seen corresponding path program 1 times [2025-03-13 22:32:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:50,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-13 22:32:50,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:50,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:50,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:50,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:50,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:50,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:50,408 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:32:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-13 22:32:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563412460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:50,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85217561] [2025-03-13 22:32:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:50,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:50,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:50,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 324 [2025-03-13 22:32:50,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 133 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:32:50,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:50,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 324 [2025-03-13 22:32:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:51,416 INFO L124 PetriNetUnfolderBase]: 4751/9573 cut-off events. [2025-03-13 22:32:51,416 INFO L125 PetriNetUnfolderBase]: For 3091/3091 co-relation queries the response was YES. [2025-03-13 22:32:51,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17269 conditions, 9573 events. 4751/9573 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 72816 event pairs, 4742 based on Foata normal form. 1/9425 useless extension candidates. Maximal degree in co-relation 8748. Up to 6279 conditions per place. [2025-03-13 22:32:51,492 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 25 selfloop transitions, 2 changer transitions 1/130 dead transitions. [2025-03-13 22:32:51,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 130 transitions, 387 flow [2025-03-13 22:32:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-03-13 22:32:51,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364197530864198 [2025-03-13 22:32:51,494 INFO L175 Difference]: Start difference. First operand has 147 places, 133 transitions, 339 flow. Second operand 3 states and 813 transitions. [2025-03-13 22:32:51,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 130 transitions, 387 flow [2025-03-13 22:32:51,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 130 transitions, 356 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:51,497 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 304 flow [2025-03-13 22:32:51,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2025-03-13 22:32:51,497 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 0 predicate places. [2025-03-13 22:32:51,497 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 304 flow [2025-03-13 22:32:51,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:32:51,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:51,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:51,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:32:51,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:32:51,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:51,498 INFO L85 PathProgramCache]: Analyzing trace with hash -385630641, now seen corresponding path program 1 times [2025-03-13 22:32:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:51,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-03-13 22:32:51,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:51,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:51,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:51,511 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:32:51,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:51,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-03-13 22:32:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061487854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:51,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011597085] [2025-03-13 22:32:51,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:51,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:51,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 324 [2025-03-13 22:32:51,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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:32:51,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:51,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 324 [2025-03-13 22:32:51,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:52,326 INFO L124 PetriNetUnfolderBase]: 3727/7779 cut-off events. [2025-03-13 22:32:52,326 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-13 22:32:52,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13681 conditions, 7779 events. 3727/7779 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 57280 event pairs, 3718 based on Foata normal form. 255/7912 useless extension candidates. Maximal degree in co-relation 13650. Up to 4999 conditions per place. [2025-03-13 22:32:52,380 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 23 selfloop transitions, 1 changer transitions 18/124 dead transitions. [2025-03-13 22:32:52,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 124 transitions, 346 flow [2025-03-13 22:32:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2025-03-13 22:32:52,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880658436213992 [2025-03-13 22:32:52,382 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 304 flow. Second operand 3 states and 766 transitions. [2025-03-13 22:32:52,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 124 transitions, 346 flow [2025-03-13 22:32:52,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 124 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:52,384 INFO L231 Difference]: Finished difference. Result has 141 places, 106 transitions, 254 flow [2025-03-13 22:32:52,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=141, PETRI_TRANSITIONS=106} [2025-03-13 22:32:52,385 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -6 predicate places. [2025-03-13 22:32:52,385 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 106 transitions, 254 flow [2025-03-13 22:32:52,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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:32:52,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:52,385 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:52,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:32:52,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:32:52,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 107883735, now seen corresponding path program 1 times [2025-03-13 22:32:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-03-13 22:32:52,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:52,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-13 22:32:52,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-13 22:32:52,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:52,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:52,483 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:32:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-03-13 22:32:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113651294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26193272] [2025-03-13 22:32:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:52,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:52,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:52,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:52,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 324 [2025-03-13 22:32:52,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 106 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 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:32:52,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:52,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 324 [2025-03-13 22:32:52,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:53,101 INFO L124 PetriNetUnfolderBase]: 2949/6144 cut-off events. [2025-03-13 22:32:53,102 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2025-03-13 22:32:53,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10516 conditions, 6144 events. 2949/6144 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 42775 event pairs, 2949 based on Foata normal form. 1/6137 useless extension candidates. Maximal degree in co-relation 10483. Up to 3975 conditions per place. [2025-03-13 22:32:53,254 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 23 selfloop transitions, 2 changer transitions 10/110 dead transitions. [2025-03-13 22:32:53,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 110 transitions, 324 flow [2025-03-13 22:32:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1362 transitions. [2025-03-13 22:32:53,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2025-03-13 22:32:53,257 INFO L175 Difference]: Start difference. First operand has 141 places, 106 transitions, 254 flow. Second operand 5 states and 1362 transitions. [2025-03-13 22:32:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 110 transitions, 324 flow [2025-03-13 22:32:53,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 110 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:53,258 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 249 flow [2025-03-13 22:32:53,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2025-03-13 22:32:53,259 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -20 predicate places. [2025-03-13 22:32:53,259 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 249 flow [2025-03-13 22:32:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 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:32:53,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:53,259 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:32:53,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:32:53,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1922937466, now seen corresponding path program 1 times [2025-03-13 22:32:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649276162] [2025-03-13 22:32:53,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:53,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-13 22:32:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-13 22:32:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:53,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:53,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-13 22:32:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-13 22:32:53,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:53,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:53,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:53,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-13 22:32:53,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-13 22:32:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:32:53,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:53,287 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:53,287 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-13 22:32:53,332 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:53,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 360 transitions, 896 flow [2025-03-13 22:32:53,362 INFO L124 PetriNetUnfolderBase]: 38/598 cut-off events. [2025-03-13 22:32:53,362 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-13 22:32:53,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 598 events. 38/598 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1587 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 660. Up to 18 conditions per place. [2025-03-13 22:32:53,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 360 transitions, 896 flow [2025-03-13 22:32:53,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 140 transitions, 371 flow [2025-03-13 22:32:53,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:53,367 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:53,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:32:53,367 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:53,367 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:32:53,367 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:53,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:53,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:53,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:32:53,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 575184599, now seen corresponding path program 1 times [2025-03-13 22:32:53,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:53,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578332747] [2025-03-13 22:32:53,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:53,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:53,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:53,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:53,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:53,386 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:32:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578332747] [2025-03-13 22:32:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578332747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:53,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190070091] [2025-03-13 22:32:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:53,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:53,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:53,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:53,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 360 [2025-03-13 22:32:53,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 140 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 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:32:53,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:53,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 360 [2025-03-13 22:32:53,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:55,341 INFO L124 PetriNetUnfolderBase]: 11024/20479 cut-off events. [2025-03-13 22:32:55,341 INFO L125 PetriNetUnfolderBase]: For 7962/7962 co-relation queries the response was YES. [2025-03-13 22:32:55,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37648 conditions, 20479 events. 11024/20479 cut-off events. For 7962/7962 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 164178 event pairs, 11014 based on Foata normal form. 1/20295 useless extension candidates. Maximal degree in co-relation 18991. Up to 14087 conditions per place. [2025-03-13 22:32:55,497 INFO L140 encePairwiseOnDemand]: 355/360 looper letters, 27 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2025-03-13 22:32:55,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 137 transitions, 423 flow [2025-03-13 22:32:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-13 22:32:55,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8351851851851851 [2025-03-13 22:32:55,499 INFO L175 Difference]: Start difference. First operand has 156 places, 140 transitions, 371 flow. Second operand 3 states and 902 transitions. [2025-03-13 22:32:55,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 137 transitions, 423 flow [2025-03-13 22:32:55,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 137 transitions, 380 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:55,503 INFO L231 Difference]: Finished difference. Result has 156 places, 136 transitions, 324 flow [2025-03-13 22:32:55,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=156, PETRI_TRANSITIONS=136} [2025-03-13 22:32:55,504 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 0 predicate places. [2025-03-13 22:32:55,504 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 136 transitions, 324 flow [2025-03-13 22:32:55,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 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:32:55,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:55,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:55,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:32:55,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:32:55,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2144386993, now seen corresponding path program 1 times [2025-03-13 22:32:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:55,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992369199] [2025-03-13 22:32:55,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:55,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:32:55,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:32:55,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:55,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:55,517 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:32:55,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:55,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992369199] [2025-03-13 22:32:55,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992369199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:55,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:55,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515414845] [2025-03-13 22:32:55,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:55,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:55,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:55,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:55,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 360 [2025-03-13 22:32:55,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 136 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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:32:55,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:55,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 360 [2025-03-13 22:32:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:57,301 INFO L124 PetriNetUnfolderBase]: 8720/16637 cut-off events. [2025-03-13 22:32:57,301 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-03-13 22:32:57,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29708 conditions, 16637 events. 8720/16637 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 129792 event pairs, 8710 based on Foata normal form. 511/16993 useless extension candidates. Maximal degree in co-relation 29676. Up to 11271 conditions per place. [2025-03-13 22:32:57,419 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 25 selfloop transitions, 1 changer transitions 18/131 dead transitions. [2025-03-13 22:32:57,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 131 transitions, 370 flow [2025-03-13 22:32:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:32:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:32:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2025-03-13 22:32:57,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7861111111111111 [2025-03-13 22:32:57,421 INFO L175 Difference]: Start difference. First operand has 156 places, 136 transitions, 324 flow. Second operand 3 states and 849 transitions. [2025-03-13 22:32:57,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 131 transitions, 370 flow [2025-03-13 22:32:57,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 131 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:32:57,423 INFO L231 Difference]: Finished difference. Result has 150 places, 113 transitions, 274 flow [2025-03-13 22:32:57,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=150, PETRI_TRANSITIONS=113} [2025-03-13 22:32:57,424 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -6 predicate places. [2025-03-13 22:32:57,424 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 113 transitions, 274 flow [2025-03-13 22:32:57,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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:32:57,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:57,424 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:57,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:32:57,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:32:57,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1814614550, now seen corresponding path program 1 times [2025-03-13 22:32:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:57,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-03-13 22:32:57,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:57,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:57,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-13 22:32:57,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-13 22:32:57,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:57,496 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:32:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-03-13 22:32:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342137267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:57,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:32:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298574078] [2025-03-13 22:32:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:57,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:32:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:57,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:32:57,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:32:57,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 360 [2025-03-13 22:32:57,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 113 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 299.8) internal successors, (1499), 5 states have internal predecessors, (1499), 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:32:57,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:57,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 360 [2025-03-13 22:32:57,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:32:58,742 INFO L124 PetriNetUnfolderBase]: 6917/13195 cut-off events. [2025-03-13 22:32:58,742 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2025-03-13 22:32:58,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22944 conditions, 13195 events. 6917/13195 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 98188 event pairs, 6917 based on Foata normal form. 1/13187 useless extension candidates. Maximal degree in co-relation 22910. Up to 8967 conditions per place. [2025-03-13 22:32:58,801 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 25 selfloop transitions, 2 changer transitions 10/117 dead transitions. [2025-03-13 22:32:58,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 117 transitions, 348 flow [2025-03-13 22:32:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:32:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:32:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1514 transitions. [2025-03-13 22:32:58,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411111111111111 [2025-03-13 22:32:58,803 INFO L175 Difference]: Start difference. First operand has 150 places, 113 transitions, 274 flow. Second operand 5 states and 1514 transitions. [2025-03-13 22:32:58,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 117 transitions, 348 flow [2025-03-13 22:32:58,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 117 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:32:58,805 INFO L231 Difference]: Finished difference. Result has 136 places, 107 transitions, 269 flow [2025-03-13 22:32:58,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=136, PETRI_TRANSITIONS=107} [2025-03-13 22:32:58,806 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -20 predicate places. [2025-03-13 22:32:58,806 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 107 transitions, 269 flow [2025-03-13 22:32:58,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 299.8) internal successors, (1499), 5 states have internal predecessors, (1499), 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:32:58,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:58,807 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:58,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:32:58,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:32:58,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash -397417187, now seen corresponding path program 1 times [2025-03-13 22:32:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:58,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-13 22:32:58,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:58,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:58,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-13 22:32:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-13 22:32:58,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:58,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:58,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:32:58,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-13 22:32:58,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-13 22:32:58,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:58,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:32:58,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:32:58,839 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:32:58,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:32:58,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:32:58,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:32:58,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:32:58,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:32:58,841 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:32:58,842 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:32:58,842 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-03-13 22:32:58,885 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:32:58,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 404 places, 396 transitions, 1008 flow [2025-03-13 22:32:58,918 INFO L124 PetriNetUnfolderBase]: 42/661 cut-off events. [2025-03-13 22:32:58,918 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-13 22:32:58,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 661 events. 42/661 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1800 event pairs, 0 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 735. Up to 20 conditions per place. [2025-03-13 22:32:58,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 404 places, 396 transitions, 1008 flow [2025-03-13 22:32:58,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 147 transitions, 405 flow [2025-03-13 22:32:58,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:32:58,922 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:32:58,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-13 22:32:58,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:32:58,923 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:32:58,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:32:58,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:32:58,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:32:58,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 22:32:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:32:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash 400009943, now seen corresponding path program 1 times [2025-03-13 22:32:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:32:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-13 22:32:58,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:32:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:32:58,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:32:58,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:32:58,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:32:58,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:32:58,937 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:32:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:32:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-13 22:32:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429963816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:32:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:32:58,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:32:58,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255904970] [2025-03-13 22:32:58,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:32:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:32:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:32:58,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:32:58,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:32:58,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 396 [2025-03-13 22:32:58,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 147 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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:32:58,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:32:58,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 396 [2025-03-13 22:32:58,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:33:03,416 INFO L124 PetriNetUnfolderBase]: 25105/43801 cut-off events. [2025-03-13 22:33:03,417 INFO L125 PetriNetUnfolderBase]: For 20002/20002 co-relation queries the response was YES. [2025-03-13 22:33:03,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81707 conditions, 43801 events. 25105/43801 cut-off events. For 20002/20002 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 366626 event pairs, 25094 based on Foata normal form. 1/43577 useless extension candidates. Maximal degree in co-relation 41010. Up to 31239 conditions per place. [2025-03-13 22:33:03,928 INFO L140 encePairwiseOnDemand]: 391/396 looper letters, 29 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2025-03-13 22:33:03,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 144 transitions, 461 flow [2025-03-13 22:33:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:33:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:33:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 991 transitions. [2025-03-13 22:33:03,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8341750841750841 [2025-03-13 22:33:03,930 INFO L175 Difference]: Start difference. First operand has 165 places, 147 transitions, 405 flow. Second operand 3 states and 991 transitions. [2025-03-13 22:33:03,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 144 transitions, 461 flow [2025-03-13 22:33:03,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 144 transitions, 404 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-13 22:33:03,935 INFO L231 Difference]: Finished difference. Result has 165 places, 143 transitions, 344 flow [2025-03-13 22:33:03,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=165, PETRI_TRANSITIONS=143} [2025-03-13 22:33:03,936 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 0 predicate places. [2025-03-13 22:33:03,936 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 143 transitions, 344 flow [2025-03-13 22:33:03,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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:33:03,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:33:03,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:33:03,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:33:03,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 22:33:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:33:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1072541873, now seen corresponding path program 1 times [2025-03-13 22:33:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:33:03,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-03-13 22:33:03,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:33:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:33:03,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:33:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:33:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:33:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:33:03,949 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:33:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:33:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-03-13 22:33:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658196898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:33:03,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:33:03,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:33:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355248157] [2025-03-13 22:33:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:33:03,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:33:03,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:33:03,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:33:03,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:33:03,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 396 [2025-03-13 22:33:03,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 143 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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:33:03,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:33:03,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 396 [2025-03-13 22:33:03,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:33:07,586 INFO L124 PetriNetUnfolderBase]: 19985/35607 cut-off events. [2025-03-13 22:33:07,586 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2025-03-13 22:33:07,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64295 conditions, 35607 events. 19985/35607 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 290893 event pairs, 19974 based on Foata normal form. 1023/36438 useless extension candidates. Maximal degree in co-relation 64262. Up to 25095 conditions per place. [2025-03-13 22:33:07,920 INFO L140 encePairwiseOnDemand]: 390/396 looper letters, 27 selfloop transitions, 1 changer transitions 18/138 dead transitions. [2025-03-13 22:33:07,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 138 transitions, 394 flow [2025-03-13 22:33:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:33:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:33:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2025-03-13 22:33:07,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7845117845117845 [2025-03-13 22:33:07,921 INFO L175 Difference]: Start difference. First operand has 165 places, 143 transitions, 344 flow. Second operand 3 states and 932 transitions. [2025-03-13 22:33:07,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 138 transitions, 394 flow [2025-03-13 22:33:07,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 138 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:33:07,924 INFO L231 Difference]: Finished difference. Result has 159 places, 120 transitions, 294 flow [2025-03-13 22:33:07,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=159, PETRI_TRANSITIONS=120} [2025-03-13 22:33:07,924 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, -6 predicate places. [2025-03-13 22:33:07,924 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 120 transitions, 294 flow [2025-03-13 22:33:07,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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:33:07,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:33:07,925 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:33:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 22:33:07,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 22:33:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:33:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1557478722, now seen corresponding path program 1 times [2025-03-13 22:33:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:33:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-03-13 22:33:07,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:33:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:33:07,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-13 22:33:07,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-13 22:33:07,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:33:07,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:33:08,002 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:33:08,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:33:08,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-03-13 22:33:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340271110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:33:08,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:33:08,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:33:08,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382622376] [2025-03-13 22:33:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:33:08,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:33:08,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:33:08,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:33:08,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:33:08,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 396 [2025-03-13 22:33:08,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 120 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 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:33:08,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:33:08,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 396 [2025-03-13 22:33:08,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:33:11,112 INFO L124 PetriNetUnfolderBase]: 15877/28310 cut-off events. [2025-03-13 22:33:11,113 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-03-13 22:33:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49836 conditions, 28310 events. 15877/28310 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 221157 event pairs, 15877 based on Foata normal form. 1/28301 useless extension candidates. Maximal degree in co-relation 49801. Up to 19975 conditions per place. [2025-03-13 22:33:11,276 INFO L140 encePairwiseOnDemand]: 390/396 looper letters, 27 selfloop transitions, 2 changer transitions 10/124 dead transitions. [2025-03-13 22:33:11,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 124 transitions, 372 flow [2025-03-13 22:33:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:33:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:33:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1666 transitions. [2025-03-13 22:33:11,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8414141414141414 [2025-03-13 22:33:11,278 INFO L175 Difference]: Start difference. First operand has 159 places, 120 transitions, 294 flow. Second operand 5 states and 1666 transitions. [2025-03-13 22:33:11,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 124 transitions, 372 flow [2025-03-13 22:33:11,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 124 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:33:11,280 INFO L231 Difference]: Finished difference. Result has 145 places, 114 transitions, 289 flow [2025-03-13 22:33:11,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=145, PETRI_TRANSITIONS=114} [2025-03-13 22:33:11,280 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, -20 predicate places. [2025-03-13 22:33:11,280 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 114 transitions, 289 flow [2025-03-13 22:33:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 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:33:11,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:33:11,281 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:33:11,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 22:33:11,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 22:33:11,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:33:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash 461015033, now seen corresponding path program 1 times [2025-03-13 22:33:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:33:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733854955] [2025-03-13 22:33:11,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:33:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:33:11,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-13 22:33:11,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-13 22:33:11,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:33:11,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:33:11,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:33:11,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-13 22:33:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-13 22:33:11,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:33:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:33:11,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:33:11,314 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-13 22:33:11,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-13 22:33:11,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-13 22:33:11,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 22:33:11,315 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:33:11,315 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:33:11,316 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-03-13 22:33:11,363 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:33:11,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 441 places, 432 transitions, 1124 flow [2025-03-13 22:33:11,402 INFO L124 PetriNetUnfolderBase]: 46/724 cut-off events. [2025-03-13 22:33:11,402 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-13 22:33:11,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 724 events. 46/724 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1975 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 811. Up to 22 conditions per place. [2025-03-13 22:33:11,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 441 places, 432 transitions, 1124 flow [2025-03-13 22:33:11,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 154 transitions, 441 flow [2025-03-13 22:33:11,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:33:11,407 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;@29dec377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:33:11,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-13 22:33:11,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:33:11,408 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-13 22:33:11,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:33:11,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:33:11,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:33:11,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 22:33:11,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:33:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 989813463, now seen corresponding path program 1 times [2025-03-13 22:33:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:33:11,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633492784] [2025-03-13 22:33:11,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:33:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:33:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:33:11,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:33:11,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:33:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:33:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:33:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:33:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633492784] [2025-03-13 22:33:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633492784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:33:11,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:33:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:33:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252174117] [2025-03-13 22:33:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:33:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:33:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:33:11,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:33:11,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:33:11,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 432 [2025-03-13 22:33:11,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 154 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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:33:11,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:33:11,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 432 [2025-03-13 22:33:11,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:33:21,911 INFO L124 PetriNetUnfolderBase]: 56338/93491 cut-off events. [2025-03-13 22:33:21,912 INFO L125 PetriNetUnfolderBase]: For 49195/49195 co-relation queries the response was YES. [2025-03-13 22:33:22,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176454 conditions, 93491 events. 56338/93491 cut-off events. For 49195/49195 co-relation queries the response was YES. Maximal size of possible extension queue 2442. Compared 810127 event pairs, 56326 based on Foata normal form. 1/93223 useless extension candidates. Maximal degree in co-relation 88117. Up to 68615 conditions per place. [2025-03-13 22:33:23,200 INFO L140 encePairwiseOnDemand]: 427/432 looper letters, 31 selfloop transitions, 2 changer transitions 1/151 dead transitions. [2025-03-13 22:33:23,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 151 transitions, 501 flow [2025-03-13 22:33:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:33:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:33:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1080 transitions. [2025-03-13 22:33:23,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-13 22:33:23,201 INFO L175 Difference]: Start difference. First operand has 174 places, 154 transitions, 441 flow. Second operand 3 states and 1080 transitions. [2025-03-13 22:33:23,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 151 transitions, 501 flow [2025-03-13 22:33:23,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 151 transitions, 428 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-03-13 22:33:23,212 INFO L231 Difference]: Finished difference. Result has 174 places, 150 transitions, 364 flow [2025-03-13 22:33:23,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=432, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=174, PETRI_TRANSITIONS=150} [2025-03-13 22:33:23,212 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2025-03-13 22:33:23,212 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 150 transitions, 364 flow [2025-03-13 22:33:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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:33:23,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:33:23,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:33:23,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 22:33:23,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 22:33:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:33:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1465062577, now seen corresponding path program 1 times [2025-03-13 22:33:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:33:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-03-13 22:33:23,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:33:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:33:23,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:33:23,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:33:23,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:33:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:33:23,227 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:33:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:33:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-03-13 22:33:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652664571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:33:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:33:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:33:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36089725] [2025-03-13 22:33:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:33:23,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:33:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:33:23,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:33:23,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:33:23,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 432 [2025-03-13 22:33:23,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 150 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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:33:23,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:33:23,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 432 [2025-03-13 22:33:23,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand