/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/31_simple_loop5_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:52:26,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:52:26,981 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:52:26,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:52:26,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:52:27,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:52:27,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:52:27,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:52:27,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:52:27,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:52:27,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:52:27,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:52:27,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:52:27,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:52:27,008 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:52:27,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:52:27,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:52:27,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:52:27,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:52:27,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:52:27,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:52:27,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:52:27,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:52:27,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:52:27,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:52:27,011 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:52:27,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:52:27,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:52:27,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:52:27,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:52:27,262 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:52:27,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs.i [2025-04-13 23:52:28,479 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c60875c/4a9e852c50f24f32a7b0564699a31e0e/FLAGb02b101c4 [2025-04-13 23:52:28,725 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:52:28,725 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs.i [2025-04-13 23:52:28,733 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c60875c/4a9e852c50f24f32a7b0564699a31e0e/FLAGb02b101c4 [2025-04-13 23:52:29,528 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c60875c/4a9e852c50f24f32a7b0564699a31e0e [2025-04-13 23:52:29,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:52:29,531 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:52:29,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:52:29,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:52:29,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:52:29,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60793811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29, skipping insertion in model container [2025-04-13 23:52:29,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:52:29,833 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/31_simple_loop5_vs.i[30640,30653] [2025-04-13 23:52:29,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:52:29,852 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:52:29,900 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/31_simple_loop5_vs.i[30640,30653] [2025-04-13 23:52:29,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:52:29,922 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:52:29,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29 WrapperNode [2025-04-13 23:52:29,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:52:29,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:52:29,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:52:29,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:52:29,927 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:52:29" (1/1) ... [2025-04-13 23:52:29,938 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:52:29" (1/1) ... [2025-04-13 23:52:29,950 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-04-13 23:52:29,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:52:29,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:52:29,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:52:29,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:52:29,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,964 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:52:29,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:52:29,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:52:29,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:52:29,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:52:29,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (1/1) ... [2025-04-13 23:52:29,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:52:29,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:52:29,994 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:52:29,996 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:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-13 23:52:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-13 23:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:52:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:52:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:52:30,012 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:52:30,096 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:52:30,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:52:30,182 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:52:30,183 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:52:30,183 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:52:30,263 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:52:30,265 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:52:30,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:52:30 BoogieIcfgContainer [2025-04-13 23:52:30,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:52:30,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:52:30,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:52:30,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:52:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:52:29" (1/3) ... [2025-04-13 23:52:30,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eacfea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:52:30, skipping insertion in model container [2025-04-13 23:52:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:52:29" (2/3) ... [2025-04-13 23:52:30,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eacfea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:52:30, skipping insertion in model container [2025-04-13 23:52:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:52:30" (3/3) ... [2025-04-13 23:52:30,271 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-04-13 23:52:30,280 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:52:30,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 19 locations, 20 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:52:30,281 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:52:30,312 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:52:30,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 22 transitions, 52 flow [2025-04-13 23:52:30,359 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-13 23:52:30,363 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:52:30,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 21 events. 2/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 47 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 23:52:30,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 22 transitions, 52 flow [2025-04-13 23:52:30,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 21 transitions, 49 flow [2025-04-13 23:52:30,377 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:52:30,386 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;@6165a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:52:30,386 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:52:30,392 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:52:30,392 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 23:52:30,392 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:52:30,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:30,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:52:30,395 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:52:30,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash 148984820, now seen corresponding path program 1 times [2025-04-13 23:52:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:30,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422360540] [2025-04-13 23:52:30,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:30,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:52:30,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:52:30,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:30,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:30,607 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:52:30,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:30,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422360540] [2025-04-13 23:52:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422360540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:30,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:30,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:52:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252564245] [2025-04-13 23:52:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:30,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:30,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:30,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:30,636 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-04-13 23:52:30,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:52:30,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:30,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-04-13 23:52:30,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:30,713 INFO L116 PetriNetUnfolderBase]: 96/187 cut-off events. [2025-04-13 23:52:30,713 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:52:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 187 events. 96/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 658 event pairs, 29 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 353. Up to 85 conditions per place. [2025-04-13 23:52:30,715 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 16 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-04-13 23:52:30,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 93 flow [2025-04-13 23:52:30,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-13 23:52:30,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-04-13 23:52:30,728 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 49 flow. Second operand 3 states and 45 transitions. [2025-04-13 23:52:30,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 93 flow [2025-04-13 23:52:30,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:52:30,732 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 62 flow [2025-04-13 23:52:30,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2025-04-13 23:52:30,736 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-04-13 23:52:30,736 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 62 flow [2025-04-13 23:52:30,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:52:30,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:30,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:52:30,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:52:30,736 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:52:30,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 322942746, now seen corresponding path program 1 times [2025-04-13 23:52:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:30,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975259885] [2025-04-13 23:52:30,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:30,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:52:30,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:52:30,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:30,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:30,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:52:30,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:52:30,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:52:30,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:30,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:30,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:52:30,802 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:52:30,803 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:52:30,804 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:52:30,804 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:52:30,804 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:52:30,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:52:30,804 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:52:30,806 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:52:30,806 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:52:30,820 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:52:30,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 94 flow [2025-04-13 23:52:30,831 INFO L116 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-04-13 23:52:30,832 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:52:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 30 events. 3/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-04-13 23:52:30,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 94 flow [2025-04-13 23:52:30,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 69 flow [2025-04-13 23:52:30,834 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:52:30,835 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;@6165a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:52:30,835 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:52:30,837 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:52:30,837 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 23:52:30,837 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:52:30,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:30,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:52:30,837 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:52:30,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash 184717137, now seen corresponding path program 1 times [2025-04-13 23:52:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:30,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031413386] [2025-04-13 23:52:30,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:30,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:52:30,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:52:30,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:30,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:30,877 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:52:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:30,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031413386] [2025-04-13 23:52:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031413386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:52:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021269887] [2025-04-13 23:52:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:30,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:30,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:30,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:30,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:30,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-04-13 23:52:30,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 69 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:52:30,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:30,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-04-13 23:52:30,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:31,046 INFO L116 PetriNetUnfolderBase]: 760/1205 cut-off events. [2025-04-13 23:52:31,046 INFO L117 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-04-13 23:52:31,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1205 events. 760/1205 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5668 event pairs, 185 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2376. Up to 644 conditions per place. [2025-04-13 23:52:31,057 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 23 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-13 23:52:31,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 140 flow [2025-04-13 23:52:31,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 23:52:31,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6036036036036037 [2025-04-13 23:52:31,059 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 69 flow. Second operand 3 states and 67 transitions. [2025-04-13 23:52:31,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 140 flow [2025-04-13 23:52:31,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:52:31,060 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 88 flow [2025-04-13 23:52:31,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-04-13 23:52:31,061 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-04-13 23:52:31,061 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 88 flow [2025-04-13 23:52:31,061 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:52:31,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:31,061 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:31,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:52:31,061 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:52:31,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 294466346, now seen corresponding path program 1 times [2025-04-13 23:52:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:31,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650143580] [2025-04-13 23:52:31,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:31,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:52:31,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:52:31,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:31,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:31,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:52:31,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:52:31,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:52:31,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:31,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:31,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:52:31,100 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:52:31,100 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:52:31,100 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:52:31,100 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 23:52:31,100 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:52:31,100 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:52:31,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:52:31,100 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:52:31,101 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:52:31,101 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:52:31,125 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:52:31,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 140 flow [2025-04-13 23:52:31,131 INFO L116 PetriNetUnfolderBase]: 4/39 cut-off events. [2025-04-13 23:52:31,131 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:52:31,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 39 events. 4/39 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2025-04-13 23:52:31,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 140 flow [2025-04-13 23:52:31,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 91 flow [2025-04-13 23:52:31,135 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:52:31,135 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;@6165a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:52:31,135 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:52:31,137 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:52:31,137 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 23:52:31,137 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:52:31,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:31,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:52:31,138 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 23:52:31,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash 234770980, now seen corresponding path program 1 times [2025-04-13 23:52:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:31,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520691750] [2025-04-13 23:52:31,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:31,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:52:31,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:52:31,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:31,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:31,187 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:52:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:31,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520691750] [2025-04-13 23:52:31,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520691750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:31,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:31,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:52:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121527560] [2025-04-13 23:52:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:31,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:31,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:31,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:31,188 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2025-04-13 23:52:31,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:52:31,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:31,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2025-04-13 23:52:31,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:31,625 INFO L116 PetriNetUnfolderBase]: 4492/6423 cut-off events. [2025-04-13 23:52:31,625 INFO L117 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2025-04-13 23:52:31,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12876 conditions, 6423 events. 4492/6423 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 34221 event pairs, 1075 based on Foata normal form. 0/6208 useless extension candidates. Maximal degree in co-relation 12864. Up to 3740 conditions per place. [2025-04-13 23:52:31,661 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 30 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-04-13 23:52:31,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 191 flow [2025-04-13 23:52:31,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-13 23:52:31,663 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2025-04-13 23:52:31,664 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 91 flow. Second operand 3 states and 89 transitions. [2025-04-13 23:52:31,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 191 flow [2025-04-13 23:52:31,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 23:52:31,666 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 114 flow [2025-04-13 23:52:31,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 23:52:31,668 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-04-13 23:52:31,668 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 114 flow [2025-04-13 23:52:31,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:52:31,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:31,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:31,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:52:31,669 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 23:52:31,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -240678734, now seen corresponding path program 1 times [2025-04-13 23:52:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:31,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745699516] [2025-04-13 23:52:31,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:31,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:52:31,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:52:31,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:31,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:31,731 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:52:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:31,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745699516] [2025-04-13 23:52:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745699516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:31,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:31,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:52:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839614950] [2025-04-13 23:52:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:31,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:31,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:31,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:31,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2025-04-13 23:52:31,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:52:31,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:31,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2025-04-13 23:52:31,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:31,851 INFO L116 PetriNetUnfolderBase]: 388/812 cut-off events. [2025-04-13 23:52:31,852 INFO L117 PetriNetUnfolderBase]: For 299/299 co-relation queries the response was YES. [2025-04-13 23:52:31,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 812 events. 388/812 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4213 event pairs, 56 based on Foata normal form. 568/1349 useless extension candidates. Maximal degree in co-relation 2012. Up to 589 conditions per place. [2025-04-13 23:52:31,856 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 21 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-04-13 23:52:31,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 195 flow [2025-04-13 23:52:31,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 23:52:31,858 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2025-04-13 23:52:31,858 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 114 flow. Second operand 3 states and 71 transitions. [2025-04-13 23:52:31,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 195 flow [2025-04-13 23:52:31,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:52:31,860 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 120 flow [2025-04-13 23:52:31,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 23:52:31,862 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-04-13 23:52:31,863 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 120 flow [2025-04-13 23:52:31,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:52:31,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:31,863 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:31,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:52:31,863 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 23:52:31,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1606973323, now seen corresponding path program 1 times [2025-04-13 23:52:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:31,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622830732] [2025-04-13 23:52:31,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:52:31,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:52:31,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:31,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:52:31,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:52:31,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:52:31,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:31,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:31,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:52:31,888 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:52:31,888 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:52:31,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:52:31,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 23:52:31,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:52:31,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:52:31,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:52:31,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:52:31,889 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 23:52:31,889 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:52:31,889 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:52:31,919 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:52:31,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 67 transitions, 190 flow [2025-04-13 23:52:31,926 INFO L116 PetriNetUnfolderBase]: 5/48 cut-off events. [2025-04-13 23:52:31,926 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:52:31,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 48 events. 5/48 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 64. Up to 5 conditions per place. [2025-04-13 23:52:31,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 67 transitions, 190 flow [2025-04-13 23:52:31,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 42 transitions, 115 flow [2025-04-13 23:52:31,929 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:52:31,929 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;@6165a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:52:31,929 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:52:31,931 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:52:31,931 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 23:52:31,931 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:52:31,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:31,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:52:31,931 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:52:31,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 299146349, now seen corresponding path program 1 times [2025-04-13 23:52:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:31,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187223505] [2025-04-13 23:52:31,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:31,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:52:31,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:52:31,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:31,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:31,971 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:52:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:31,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187223505] [2025-04-13 23:52:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187223505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:31,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:31,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:52:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567681871] [2025-04-13 23:52:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:31,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:31,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:31,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:31,973 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-04-13 23:52:31,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:52:31,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:31,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-04-13 23:52:31,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:33,654 INFO L116 PetriNetUnfolderBase]: 23538/31507 cut-off events. [2025-04-13 23:52:33,655 INFO L117 PetriNetUnfolderBase]: For 7733/7733 co-relation queries the response was YES. [2025-04-13 23:52:33,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63700 conditions, 31507 events. 23538/31507 cut-off events. For 7733/7733 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 179249 event pairs, 5913 based on Foata normal form. 0/30598 useless extension candidates. Maximal degree in co-relation 63687. Up to 19170 conditions per place. [2025-04-13 23:52:33,847 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 37 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2025-04-13 23:52:33,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 246 flow [2025-04-13 23:52:33,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-04-13 23:52:33,850 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5522388059701493 [2025-04-13 23:52:33,850 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 115 flow. Second operand 3 states and 111 transitions. [2025-04-13 23:52:33,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 246 flow [2025-04-13 23:52:33,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 233 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:52:33,860 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 140 flow [2025-04-13 23:52:33,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-04-13 23:52:33,862 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-04-13 23:52:33,862 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 140 flow [2025-04-13 23:52:33,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:52:33,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:33,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:33,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:52:33,863 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:52:33,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1993368273, now seen corresponding path program 1 times [2025-04-13 23:52:33,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:33,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066484586] [2025-04-13 23:52:33,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:33,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:52:33,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:52:33,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:33,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:33,920 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:52:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:33,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066484586] [2025-04-13 23:52:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066484586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:52:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718311962] [2025-04-13 23:52:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:33,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:33,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:33,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:33,921 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-04-13 23:52:33,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:52:33,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:33,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-04-13 23:52:33,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:34,092 INFO L116 PetriNetUnfolderBase]: 1033/2060 cut-off events. [2025-04-13 23:52:34,092 INFO L117 PetriNetUnfolderBase]: For 916/916 co-relation queries the response was YES. [2025-04-13 23:52:34,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5195 conditions, 2060 events. 1033/2060 cut-off events. For 916/916 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12653 event pairs, 148 based on Foata normal form. 1904/3900 useless extension candidates. Maximal degree in co-relation 5179. Up to 1536 conditions per place. [2025-04-13 23:52:34,106 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 25 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2025-04-13 23:52:34,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 240 flow [2025-04-13 23:52:34,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-13 23:52:34,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4427860696517413 [2025-04-13 23:52:34,108 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 140 flow. Second operand 3 states and 89 transitions. [2025-04-13 23:52:34,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 240 flow [2025-04-13 23:52:34,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:52:34,113 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2025-04-13 23:52:34,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-04-13 23:52:34,113 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-04-13 23:52:34,113 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2025-04-13 23:52:34,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:52:34,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:34,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:34,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:52:34,114 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:52:34,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1270954457, now seen corresponding path program 1 times [2025-04-13 23:52:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:34,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845695942] [2025-04-13 23:52:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:34,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:52:34,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:52:34,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:34,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:34,200 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:52:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:34,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845695942] [2025-04-13 23:52:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845695942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:34,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:34,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:52:34,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347199953] [2025-04-13 23:52:34,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:34,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:52:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:34,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:52:34,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:52:34,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-04-13 23:52:34,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:52:34,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:34,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-04-13 23:52:34,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:34,448 INFO L116 PetriNetUnfolderBase]: 1666/3198 cut-off events. [2025-04-13 23:52:34,448 INFO L117 PetriNetUnfolderBase]: For 1178/1178 co-relation queries the response was YES. [2025-04-13 23:52:34,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9006 conditions, 3198 events. 1666/3198 cut-off events. For 1178/1178 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 20966 event pairs, 63 based on Foata normal form. 0/3138 useless extension candidates. Maximal degree in co-relation 8991. Up to 2152 conditions per place. [2025-04-13 23:52:34,463 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 55 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2025-04-13 23:52:34,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 454 flow [2025-04-13 23:52:34,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:52:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:52:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-13 23:52:34,464 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48880597014925375 [2025-04-13 23:52:34,464 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 131 transitions. [2025-04-13 23:52:34,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 454 flow [2025-04-13 23:52:34,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:52:34,467 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 242 flow [2025-04-13 23:52:34,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2025-04-13 23:52:34,467 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-04-13 23:52:34,467 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 242 flow [2025-04-13 23:52:34,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:52:34,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:34,467 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:34,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:52:34,468 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:52:34,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash 61506203, now seen corresponding path program 1 times [2025-04-13 23:52:34,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:34,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162823310] [2025-04-13 23:52:34,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:34,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:52:34,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:52:34,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:34,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:34,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:52:34,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:52:34,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:52:34,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:34,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:34,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:52:34,489 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:52:34,489 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 23:52:34,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 23:52:34,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 23:52:34,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 23:52:34,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 23:52:34,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 23:52:34,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:52:34,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:52:34,489 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 23:52:34,493 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:52:34,493 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:52:34,520 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:52:34,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 82 transitions, 244 flow [2025-04-13 23:52:34,526 INFO L116 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-04-13 23:52:34,526 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:52:34,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 57 events. 6/57 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 79. Up to 6 conditions per place. [2025-04-13 23:52:34,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 82 transitions, 244 flow [2025-04-13 23:52:34,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 49 transitions, 141 flow [2025-04-13 23:52:34,527 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:52:34,528 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;@6165a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:52:34,528 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 23:52:34,529 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:52:34,529 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 23:52:34,529 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:52:34,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:34,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:52:34,529 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:52:34,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash 377815440, now seen corresponding path program 1 times [2025-04-13 23:52:34,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:34,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448005512] [2025-04-13 23:52:34,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:34,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:34,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:52:34,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:52:34,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:34,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:34,550 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:52:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:34,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448005512] [2025-04-13 23:52:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448005512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:34,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:52:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073971504] [2025-04-13 23:52:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:34,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:34,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:34,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:34,551 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 82 [2025-04-13 23:52:34,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:52:34,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:34,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 82 [2025-04-13 23:52:34,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:40,797 INFO L116 PetriNetUnfolderBase]: 116006/148285 cut-off events. [2025-04-13 23:52:40,797 INFO L117 PetriNetUnfolderBase]: For 49466/49466 co-relation queries the response was YES. [2025-04-13 23:52:41,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301739 conditions, 148285 events. 116006/148285 cut-off events. For 49466/49466 co-relation queries the response was YES. Maximal size of possible extension queue 4644. Compared 877585 event pairs, 30983 based on Foata normal form. 0/144554 useless extension candidates. Maximal degree in co-relation 301725. Up to 92734 conditions per place. [2025-04-13 23:52:41,750 INFO L140 encePairwiseOnDemand]: 66/82 looper letters, 44 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-04-13 23:52:41,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 305 flow [2025-04-13 23:52:41,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-04-13 23:52:41,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.540650406504065 [2025-04-13 23:52:41,751 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 141 flow. Second operand 3 states and 133 transitions. [2025-04-13 23:52:41,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 305 flow [2025-04-13 23:52:41,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 280 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-13 23:52:41,774 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 166 flow [2025-04-13 23:52:41,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-04-13 23:52:41,774 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-04-13 23:52:41,775 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 166 flow [2025-04-13 23:52:41,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:52:41,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:41,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:41,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:52:41,775 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:52:41,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1899438749, now seen corresponding path program 1 times [2025-04-13 23:52:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:41,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906459263] [2025-04-13 23:52:41,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:41,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:52:41,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:52:41,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:41,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:41,812 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:52:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:41,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906459263] [2025-04-13 23:52:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906459263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:41,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:41,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:52:41,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341904673] [2025-04-13 23:52:41,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:41,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:41,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:41,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:41,814 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 82 [2025-04-13 23:52:41,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:52:41,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:41,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 82 [2025-04-13 23:52:41,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:42,041 INFO L116 PetriNetUnfolderBase]: 2554/4946 cut-off events. [2025-04-13 23:52:42,041 INFO L117 PetriNetUnfolderBase]: For 2541/2541 co-relation queries the response was YES. [2025-04-13 23:52:42,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12554 conditions, 4946 events. 2554/4946 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 34919 event pairs, 380 based on Foata normal form. 5642/10459 useless extension candidates. Maximal degree in co-relation 12537. Up to 3753 conditions per place. [2025-04-13 23:52:42,070 INFO L140 encePairwiseOnDemand]: 70/82 looper letters, 29 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2025-04-13 23:52:42,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 285 flow [2025-04-13 23:52:42,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:52:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:52:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-04-13 23:52:42,073 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2025-04-13 23:52:42,073 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 166 flow. Second operand 3 states and 107 transitions. [2025-04-13 23:52:42,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 285 flow [2025-04-13 23:52:42,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:52:42,079 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 176 flow [2025-04-13 23:52:42,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-04-13 23:52:42,080 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-04-13 23:52:42,080 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 176 flow [2025-04-13 23:52:42,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:52:42,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:42,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:42,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:52:42,080 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:52:42,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1833837149, now seen corresponding path program 1 times [2025-04-13 23:52:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:42,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038138585] [2025-04-13 23:52:42,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:42,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:52:42,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:52:42,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:42,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:42,132 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:52:42,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:42,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038138585] [2025-04-13 23:52:42,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038138585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:42,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:42,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:52:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564650756] [2025-04-13 23:52:42,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:42,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:52:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:42,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:52:42,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:52:42,133 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 82 [2025-04-13 23:52:42,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:52:42,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:42,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 82 [2025-04-13 23:52:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:42,611 INFO L116 PetriNetUnfolderBase]: 3869/7123 cut-off events. [2025-04-13 23:52:42,611 INFO L117 PetriNetUnfolderBase]: For 2555/2555 co-relation queries the response was YES. [2025-04-13 23:52:42,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20290 conditions, 7123 events. 3869/7123 cut-off events. For 2555/2555 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 50842 event pairs, 115 based on Foata normal form. 0/6999 useless extension candidates. Maximal degree in co-relation 20274. Up to 5348 conditions per place. [2025-04-13 23:52:42,646 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 65 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2025-04-13 23:52:42,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 546 flow [2025-04-13 23:52:42,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:52:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:52:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-04-13 23:52:42,647 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2025-04-13 23:52:42,647 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 176 flow. Second operand 4 states and 158 transitions. [2025-04-13 23:52:42,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 546 flow [2025-04-13 23:52:42,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:52:42,652 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 293 flow [2025-04-13 23:52:42,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-04-13 23:52:42,653 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2025-04-13 23:52:42,653 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 293 flow [2025-04-13 23:52:42,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:52:42,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:42,653 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:52:42,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:52:42,653 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:52:42,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 47279420, now seen corresponding path program 1 times [2025-04-13 23:52:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:42,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474816790] [2025-04-13 23:52:42,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:42,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:42,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:52:42,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:52:42,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:42,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:52:42,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:52:42,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:52:42,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:42,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:52:42,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:52:42,675 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:52:42,675 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 23:52:42,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 23:52:42,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-04-13 23:52:42,676 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 23:52:42,676 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 23:52:42,676 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 23:52:42,676 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 23:52:42,676 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 23:52:42,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:52:42,676 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 23:52:42,676 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:52:42,676 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 23:52:42,709 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:52:42,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 97 transitions, 302 flow [2025-04-13 23:52:42,716 INFO L116 PetriNetUnfolderBase]: 7/66 cut-off events. [2025-04-13 23:52:42,716 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 23:52:42,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 66 events. 7/66 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 158 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 95. Up to 7 conditions per place. [2025-04-13 23:52:42,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 97 transitions, 302 flow [2025-04-13 23:52:42,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 56 transitions, 169 flow [2025-04-13 23:52:42,718 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:52:42,719 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;@6165a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:52:42,719 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 23:52:42,720 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:52:42,720 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:52:42,720 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:52:42,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:52:42,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:52:42,720 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:52:42,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:52:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash 470792155, now seen corresponding path program 1 times [2025-04-13 23:52:42,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:52:42,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053835557] [2025-04-13 23:52:42,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:52:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:52:42,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:52:42,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:52:42,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:52:42,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:52:42,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-04-13 23:52:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:52:42,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053835557] [2025-04-13 23:52:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053835557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:52:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:52:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:52:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681628982] [2025-04-13 23:52:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:52:42,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:52:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:52:42,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:52:42,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:52:42,746 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 23:52:42,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:52:42,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:52:42,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 23:52:42,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:17,085 INFO L116 PetriNetUnfolderBase]: 550976/680781 cut-off events. [2025-04-13 23:53:17,085 INFO L117 PetriNetUnfolderBase]: For 288753/288753 co-relation queries the response was YES. [2025-04-13 23:53:18,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392393 conditions, 680781 events. 550976/680781 cut-off events. For 288753/288753 co-relation queries the response was YES. Maximal size of possible extension queue 17831. Compared 4122318 event pairs, 155685 based on Foata normal form. 0/665718 useless extension candidates. Maximal degree in co-relation 1392378. Up to 434032 conditions per place. [2025-04-13 23:53:21,826 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 51 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2025-04-13 23:53:21,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 368 flow [2025-04-13 23:53:21,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-04-13 23:53:21,827 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5326460481099656 [2025-04-13 23:53:21,827 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 169 flow. Second operand 3 states and 155 transitions. [2025-04-13 23:53:21,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 368 flow [2025-04-13 23:53:22,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 327 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-04-13 23:53:22,019 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 192 flow [2025-04-13 23:53:22,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-04-13 23:53:22,019 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-04-13 23:53:22,020 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 192 flow [2025-04-13 23:53:22,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:22,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:22,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:22,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 23:53:22,020 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:53:22,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1789384286, now seen corresponding path program 1 times [2025-04-13 23:53:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:22,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489976302] [2025-04-13 23:53:22,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:22,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:53:22,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:53:22,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:22,060 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:22,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:22,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489976302] [2025-04-13 23:53:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489976302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:22,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:22,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:53:22,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655471725] [2025-04-13 23:53:22,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:22,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:22,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:22,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:22,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:22,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 23:53:22,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:22,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:22,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 23:53:22,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:22,619 INFO L116 PetriNetUnfolderBase]: 6043/11482 cut-off events. [2025-04-13 23:53:22,619 INFO L117 PetriNetUnfolderBase]: For 6666/6666 co-relation queries the response was YES. [2025-04-13 23:53:22,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29284 conditions, 11482 events. 6043/11482 cut-off events. For 6666/6666 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 91168 event pairs, 952 based on Foata normal form. 15530/26756 useless extension candidates. Maximal degree in co-relation 29266. Up to 8820 conditions per place. [2025-04-13 23:53:22,705 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 33 selfloop transitions, 14 changer transitions 0/62 dead transitions. [2025-04-13 23:53:22,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 330 flow [2025-04-13 23:53:22,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-04-13 23:53:22,706 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42955326460481097 [2025-04-13 23:53:22,706 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 192 flow. Second operand 3 states and 125 transitions. [2025-04-13 23:53:22,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 330 flow [2025-04-13 23:53:22,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:53:22,723 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 204 flow [2025-04-13 23:53:22,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-04-13 23:53:22,723 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2025-04-13 23:53:22,723 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 204 flow [2025-04-13 23:53:22,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:22,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:22,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:22,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:53:22,724 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:53:22,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1160731365, now seen corresponding path program 1 times [2025-04-13 23:53:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:22,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209280817] [2025-04-13 23:53:22,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:22,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:53:22,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:53:22,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:22,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:22,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209280817] [2025-04-13 23:53:22,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209280817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:22,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:22,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014611948] [2025-04-13 23:53:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:22,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:53:22,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:22,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:53:22,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:53:22,770 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 23:53:22,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:22,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:22,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 23:53:22,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:23,509 INFO L116 PetriNetUnfolderBase]: 8696/15527 cut-off events. [2025-04-13 23:53:23,509 INFO L117 PetriNetUnfolderBase]: For 5333/5333 co-relation queries the response was YES. [2025-04-13 23:53:23,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44560 conditions, 15527 events. 8696/15527 cut-off events. For 5333/5333 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 119615 event pairs, 263 based on Foata normal form. 0/15276 useless extension candidates. Maximal degree in co-relation 44543. Up to 12652 conditions per place. [2025-04-13 23:53:23,612 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 75 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2025-04-13 23:53:23,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 638 flow [2025-04-13 23:53:23,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:53:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:53:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-04-13 23:53:23,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47680412371134023 [2025-04-13 23:53:23,613 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 204 flow. Second operand 4 states and 185 transitions. [2025-04-13 23:53:23,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 638 flow [2025-04-13 23:53:23,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:53:23,627 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 344 flow [2025-04-13 23:53:23,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2025-04-13 23:53:23,628 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-04-13 23:53:23,628 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 344 flow [2025-04-13 23:53:23,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:23,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:23,628 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:23,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 23:53:23,628 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:53:23,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash -754494314, now seen corresponding path program 1 times [2025-04-13 23:53:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:23,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887313560] [2025-04-13 23:53:23,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:23,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:53:23,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:53:23,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:23,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:23,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:23,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887313560] [2025-04-13 23:53:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887313560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:53:23,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892186922] [2025-04-13 23:53:23,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:23,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:53:23,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:53:23,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:53:23,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:53:23,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:53:23,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:53:23,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:23,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:23,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:53:23,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:53:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:23,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:53:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892186922] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:53:23,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:53:23,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-04-13 23:53:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541583206] [2025-04-13 23:53:23,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:53:23,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:53:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:23,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:53:23,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:53:23,980 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-04-13 23:53:23,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 344 flow. Second operand has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 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:23,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:23,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-04-13 23:53:23,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:26,495 INFO L116 PetriNetUnfolderBase]: 22949/41058 cut-off events. [2025-04-13 23:53:26,496 INFO L117 PetriNetUnfolderBase]: For 21749/21749 co-relation queries the response was YES. [2025-04-13 23:53:26,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110285 conditions, 41058 events. 22949/41058 cut-off events. For 21749/21749 co-relation queries the response was YES. Maximal size of possible extension queue 1791. Compared 364953 event pairs, 3724 based on Foata normal form. 240/41287 useless extension candidates. Maximal degree in co-relation 110265. Up to 13797 conditions per place. [2025-04-13 23:53:26,760 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 71 selfloop transitions, 55 changer transitions 0/141 dead transitions. [2025-04-13 23:53:26,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 920 flow [2025-04-13 23:53:26,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:53:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 23:53:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-04-13 23:53:26,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44948453608247424 [2025-04-13 23:53:26,761 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 344 flow. Second operand 5 states and 218 transitions. [2025-04-13 23:53:26,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 920 flow [2025-04-13 23:53:26,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 141 transitions, 920 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:53:26,785 INFO L231 Difference]: Finished difference. Result has 67 places, 96 transitions, 636 flow [2025-04-13 23:53:26,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=636, PETRI_PLACES=67, PETRI_TRANSITIONS=96} [2025-04-13 23:53:26,786 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2025-04-13 23:53:26,786 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 96 transitions, 636 flow [2025-04-13 23:53:26,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 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:26,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:26,786 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:26,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:53:26,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:53:26,991 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:53:26,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash 12260344, now seen corresponding path program 1 times [2025-04-13 23:53:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:26,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990682570] [2025-04-13 23:53:26,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:26,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:53:27,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:53:27,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:27,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:27,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:27,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:53:27,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:53:27,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:27,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:27,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:27,013 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 23:53:27,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 23:53:27,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 23:53:27,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 23:53:27,014 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:27,014 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-13 23:53:27,040 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:27,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 112 transitions, 364 flow [2025-04-13 23:53:27,048 INFO L116 PetriNetUnfolderBase]: 8/75 cut-off events. [2025-04-13 23:53:27,048 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-13 23:53:27,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 75 events. 8/75 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 192 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 112. Up to 8 conditions per place. [2025-04-13 23:53:27,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 112 transitions, 364 flow [2025-04-13 23:53:27,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 63 transitions, 199 flow [2025-04-13 23:53:27,050 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:27,050 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;@6165a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:27,050 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-13 23:53:27,050 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:27,050 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:53:27,050 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:27,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:27,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:53:27,051 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:53:27,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash 578111249, now seen corresponding path program 1 times [2025-04-13 23:53:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:27,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215314962] [2025-04-13 23:53:27,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:27,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:53:27,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:53:27,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:27,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:27,071 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:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:27,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215314962] [2025-04-13 23:53:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215314962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:53:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080260049] [2025-04-13 23:53:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:27,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:27,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:27,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:27,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 112 [2025-04-13 23:53:27,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:27,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:27,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 112 [2025-04-13 23:53:27,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand