/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:53:40,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:53:40,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:53:40,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:53:40,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:53:40,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:53:40,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:53:40,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:53:40,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:53:40,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:53:40,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:53:40,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:53:40,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:53:40,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:53:40,210 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:53:40,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:53:40,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:53:40,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:53:40,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:40,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:53:40,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:40,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:53:40,213 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:53:40,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:53:40,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:53:40,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:53:40,461 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:53:40,462 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:53:40,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2025-04-13 23:53:41,807 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0889489/fa9520301a4f46f8bfd2abe8b6f3733a/FLAG5e0d9ea47 [2025-04-13 23:53:41,989 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:53:41,990 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2025-04-13 23:53:41,997 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0889489/fa9520301a4f46f8bfd2abe8b6f3733a/FLAG5e0d9ea47 [2025-04-13 23:53:42,858 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0889489/fa9520301a4f46f8bfd2abe8b6f3733a [2025-04-13 23:53:42,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:53:42,861 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:53:42,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:53:42,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:53:42,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:53:42,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:53:42" (1/1) ... [2025-04-13 23:53:42,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e87f39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:42, skipping insertion in model container [2025-04-13 23:53:42,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:53:42" (1/1) ... [2025-04-13 23:53:42,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:53:43,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i[30834,30847] [2025-04-13 23:53:43,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:53:43,196 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:53:43,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i[30834,30847] [2025-04-13 23:53:43,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:53:43,277 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:53:43,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43 WrapperNode [2025-04-13 23:53:43,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:53:43,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:53:43,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:53:43,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:53:43,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,308 INFO L138 Inliner]: procedures = 164, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 166 [2025-04-13 23:53:43,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:53:43,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:53:43,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:53:43,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:53:43,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,333 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 23:53:43,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:53:43,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:53:43,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:53:43,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:53:43,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (1/1) ... [2025-04-13 23:53:43,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:53:43,371 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-04-13 23:53:43,375 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-04-13 23:53:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:53:43,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:53:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:53:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:53:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:53:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:53:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:53:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:53:43,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:53:43,390 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:53:43,491 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:53:43,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:53:43,660 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:53:43,663 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:53:43,663 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:53:44,320 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:53:44,332 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:53:44,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:53:44 BoogieIcfgContainer [2025-04-13 23:53:44,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:53:44,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:53:44,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:53:44,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:53:44,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:53:42" (1/3) ... [2025-04-13 23:53:44,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e06670d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:53:44, skipping insertion in model container [2025-04-13 23:53:44,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:43" (2/3) ... [2025-04-13 23:53:44,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e06670d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:53:44, skipping insertion in model container [2025-04-13 23:53:44,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:53:44" (3/3) ... [2025-04-13 23:53:44,338 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-04-13 23:53:44,349 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:53:44,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 40_barrier_vf.i that has 2 procedures, 14 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:53:44,350 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:53:44,380 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:44,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 17 transitions, 38 flow [2025-04-13 23:53:44,427 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-13 23:53:44,429 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:44,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 17 events. 2/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-13 23:53:44,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 17 transitions, 38 flow [2025-04-13 23:53:44,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 16 transitions, 36 flow [2025-04-13 23:53:44,441 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:44,448 INFO L340 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;@11bb8528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:44,448 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:53:44,453 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:44,453 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 23:53:44,454 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:44,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:44,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:44,454 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:53:44,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 11694289, now seen corresponding path program 1 times [2025-04-13 23:53:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:44,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805334889] [2025-04-13 23:53:44,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:44,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:44,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:44,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:44,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:44,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:44,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:44,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:44,763 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:44,763 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:53:44,764 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:53:44,764 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:53:44,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:53:44,765 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:53:44,769 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:44,769 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:53:44,786 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:44,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 68 flow [2025-04-13 23:53:44,794 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-13 23:53:44,794 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:53:44,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 31 events. 4/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-13 23:53:44,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 29 transitions, 68 flow [2025-04-13 23:53:44,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 66 flow [2025-04-13 23:53:44,796 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:44,796 INFO L340 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;@11bb8528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:44,796 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:53:44,802 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:44,802 INFO L116 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-04-13 23:53:44,802 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:53:44,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:44,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 23:53:44,802 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:53:44,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash -778587288, now seen corresponding path program 1 times [2025-04-13 23:53:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:44,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253964495] [2025-04-13 23:53:44,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:44,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:53:44,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:53:44,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:44,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:44,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:44,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:53:45,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:53:45,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:45,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:45,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:45,033 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:45,034 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:53:45,034 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:53:45,034 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:53:45,034 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:53:45,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:53:45,034 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:53:45,038 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:45,038 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:53:45,063 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:45,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 100 flow [2025-04-13 23:53:45,081 INFO L116 PetriNetUnfolderBase]: 6/45 cut-off events. [2025-04-13 23:53:45,081 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:53:45,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 6/45 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 4 conditions per place. [2025-04-13 23:53:45,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 100 flow [2025-04-13 23:53:45,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 98 flow [2025-04-13 23:53:45,085 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:45,087 INFO L340 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;@11bb8528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:45,087 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:53:45,099 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:45,099 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-13 23:53:45,099 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:53:45,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:45,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:45,100 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:53:45,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash 912520751, now seen corresponding path program 1 times [2025-04-13 23:53:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:45,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332059257] [2025-04-13 23:53:45,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:45,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:53:45,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:53:45,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:45,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:45,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:45,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332059257] [2025-04-13 23:53:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332059257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:45,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:45,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:45,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177000197] [2025-04-13 23:53:45,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:45,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:45,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:45,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:45,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-04-13 23:53:45,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04-13 23:53:45,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:45,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-04-13 23:53:45,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:45,821 INFO L116 PetriNetUnfolderBase]: 3802/5655 cut-off events. [2025-04-13 23:53:45,821 INFO L117 PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES. [2025-04-13 23:53:45,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11248 conditions, 5655 events. 3802/5655 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 31854 event pairs, 1178 based on Foata normal form. 0/5203 useless extension candidates. Maximal degree in co-relation 7128. Up to 2961 conditions per place. [2025-04-13 23:53:45,855 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 46 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-04-13 23:53:45,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 256 flow [2025-04-13 23:53:45,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-04-13 23:53:45,867 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6910569105691057 [2025-04-13 23:53:45,868 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 98 flow. Second operand 3 states and 85 transitions. [2025-04-13 23:53:45,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 256 flow [2025-04-13 23:53:45,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 252 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 23:53:45,876 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 121 flow [2025-04-13 23:53:45,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-04-13 23:53:45,880 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-04-13 23:53:45,880 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 121 flow [2025-04-13 23:53:45,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04-13 23:53:45,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:45,880 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 23:53:45,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:53:45,881 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:53:45,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1966330134, now seen corresponding path program 1 times [2025-04-13 23:53:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:45,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633301846] [2025-04-13 23:53:45,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:45,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:53:45,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:53:45,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:45,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:45,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:46,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:53:46,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:53:46,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:46,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:46,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:46,019 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:46,019 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:53:46,020 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:53:46,020 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:53:46,020 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:53:46,020 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:53:46,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:53:46,020 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:53:46,020 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:46,020 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:53:46,044 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:46,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 134 flow [2025-04-13 23:53:46,053 INFO L116 PetriNetUnfolderBase]: 8/59 cut-off events. [2025-04-13 23:53:46,053 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:53:46,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 59 events. 8/59 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 57. Up to 5 conditions per place. [2025-04-13 23:53:46,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 53 transitions, 134 flow [2025-04-13 23:53:46,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 52 transitions, 132 flow [2025-04-13 23:53:46,056 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:46,056 INFO L340 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;@11bb8528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:46,056 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:53:46,060 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:46,060 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-13 23:53:46,060 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 23:53:46,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:46,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:46,060 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:53:46,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1696050524, now seen corresponding path program 1 times [2025-04-13 23:53:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:46,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542041550] [2025-04-13 23:53:46,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:46,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:53:46,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:53:46,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:46,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:46,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542041550] [2025-04-13 23:53:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542041550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427507190] [2025-04-13 23:53:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:46,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:46,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:46,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:46,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:46,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 53 [2025-04-13 23:53:46,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04-13 23:53:46,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:46,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 53 [2025-04-13 23:53:46,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:49,175 INFO L116 PetriNetUnfolderBase]: 49180/65607 cut-off events. [2025-04-13 23:53:49,176 INFO L117 PetriNetUnfolderBase]: For 7357/7357 co-relation queries the response was YES. [2025-04-13 23:53:49,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131908 conditions, 65607 events. 49180/65607 cut-off events. For 7357/7357 co-relation queries the response was YES. Maximal size of possible extension queue 2951. Compared 408068 event pairs, 16184 based on Foata normal form. 0/60715 useless extension candidates. Maximal degree in co-relation 49860. Up to 33573 conditions per place. [2025-04-13 23:53:49,591 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 61 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2025-04-13 23:53:49,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 347 flow [2025-04-13 23:53:49,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-04-13 23:53:49,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2025-04-13 23:53:49,592 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 132 flow. Second operand 3 states and 111 transitions. [2025-04-13 23:53:49,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 347 flow [2025-04-13 23:53:49,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 335 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 23:53:49,597 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 159 flow [2025-04-13 23:53:49,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2025-04-13 23:53:49,597 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2025-04-13 23:53:49,598 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 159 flow [2025-04-13 23:53:49,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04-13 23:53:49,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:49,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:49,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:53:49,598 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:53:49,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1037988988, now seen corresponding path program 1 times [2025-04-13 23:53:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:49,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869121363] [2025-04-13 23:53:49,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:53:49,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:53:49,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:49,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:49,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:49,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869121363] [2025-04-13 23:53:49,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869121363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:49,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:49,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792518545] [2025-04-13 23:53:49,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:49,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:49,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:49,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:49,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:49,725 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 53 [2025-04-13 23:53:49,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-13 23:53:49,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:49,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 53 [2025-04-13 23:53:49,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:52,210 INFO L116 PetriNetUnfolderBase]: 44538/59037 cut-off events. [2025-04-13 23:53:52,211 INFO L117 PetriNetUnfolderBase]: For 9191/9191 co-relation queries the response was YES. [2025-04-13 23:53:52,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127516 conditions, 59037 events. 44538/59037 cut-off events. For 9191/9191 co-relation queries the response was YES. Maximal size of possible extension queue 2374. Compared 342323 event pairs, 14190 based on Foata normal form. 1172/60165 useless extension candidates. Maximal degree in co-relation 115885. Up to 50511 conditions per place. [2025-04-13 23:53:52,774 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 72 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-04-13 23:53:52,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 417 flow [2025-04-13 23:53:52,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-04-13 23:53:52,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5534591194968553 [2025-04-13 23:53:52,776 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 159 flow. Second operand 3 states and 88 transitions. [2025-04-13 23:53:52,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 417 flow [2025-04-13 23:53:52,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:53:52,795 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 197 flow [2025-04-13 23:53:52,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2025-04-13 23:53:52,795 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2025-04-13 23:53:52,795 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 197 flow [2025-04-13 23:53:52,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-13 23:53:52,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:52,795 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:52,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:53:52,796 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:53:52,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1257163301, now seen corresponding path program 1 times [2025-04-13 23:53:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:52,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137282105] [2025-04-13 23:53:52,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:52,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:53:52,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:53:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:52,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:52,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:53:52,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:53:52,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:52,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:52,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:52,887 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:52,887 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:53:52,887 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:53:52,888 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:53:52,888 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:53:52,888 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:53:52,888 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:53:52,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:53:52,888 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 23:53:52,888 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:52,888 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:53:52,920 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:52,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 65 transitions, 170 flow [2025-04-13 23:53:52,929 INFO L116 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-04-13 23:53:52,929 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:53:52,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 73 events. 10/73 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 225 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2025-04-13 23:53:52,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 65 transitions, 170 flow [2025-04-13 23:53:52,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 64 transitions, 168 flow [2025-04-13 23:53:52,931 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:52,931 INFO L340 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;@11bb8528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:52,931 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:53:52,935 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:52,935 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-13 23:53:52,935 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 23:53:52,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:52,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:52,935 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:53:52,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1910505457, now seen corresponding path program 1 times [2025-04-13 23:53:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:52,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890436854] [2025-04-13 23:53:52,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:52,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:53:53,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:53:53,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:53,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:53,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890436854] [2025-04-13 23:53:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890436854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163504587] [2025-04-13 23:53:53,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:53,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:53,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:53,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:53,040 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2025-04-13 23:53:53,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-04-13 23:53:53,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:53,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2025-04-13 23:53:53,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:23,006 INFO L116 PetriNetUnfolderBase]: 552292/692745 cut-off events. [2025-04-13 23:54:23,007 INFO L117 PetriNetUnfolderBase]: For 102218/102218 co-relation queries the response was YES. [2025-04-13 23:54:24,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401387 conditions, 692745 events. 552292/692745 cut-off events. For 102218/102218 co-relation queries the response was YES. Maximal size of possible extension queue 23183. Compared 4523076 event pairs, 189026 based on Foata normal form. 0/643213 useless extension candidates. Maximal degree in co-relation 258428. Up to 350891 conditions per place. [2025-04-13 23:54:27,542 INFO L140 encePairwiseOnDemand]: 48/65 looper letters, 76 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2025-04-13 23:54:27,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 442 flow [2025-04-13 23:54:27,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-04-13 23:54:27,544 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-04-13 23:54:27,544 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 168 flow. Second operand 3 states and 137 transitions. [2025-04-13 23:54:27,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 442 flow [2025-04-13 23:54:27,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 418 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-13 23:54:27,598 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 197 flow [2025-04-13 23:54:27,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-04-13 23:54:27,600 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2025-04-13 23:54:27,600 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 197 flow [2025-04-13 23:54:27,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-04-13 23:54:27,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:27,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:27,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:54:27,601 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:54:27,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash 903842735, now seen corresponding path program 1 times [2025-04-13 23:54:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:27,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960341502] [2025-04-13 23:54:27,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:27,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:54:27,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:54:27,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:27,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:27,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:27,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960341502] [2025-04-13 23:54:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960341502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753879043] [2025-04-13 23:54:27,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:27,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:27,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:27,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:27,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:27,745 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 65 [2025-04-13 23:54:27,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-04-13 23:54:27,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:27,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 65 [2025-04-13 23:54:27,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand