/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/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:54:29,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:54:29,205 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:54:29,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:54:29,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:54:29,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:54:29,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:54:29,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:54:29,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:54:29,228 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:54:29,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:54:29,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:54:29,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:54:29,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:54:29,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:54:29,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:54:29,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:54:29,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:54:29,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:54:29,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:54:29,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:54:29,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:54:29,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:54:29,231 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:54:29,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:54:29,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:54:29,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:54:29,432 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:54:29,432 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:54:29,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2025-04-13 23:54:30,725 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7178f667c/66d248e4c533425ab07bbcf1b0adc71f/FLAGb0ea0d2bd [2025-04-13 23:54:30,960 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:54:30,960 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2025-04-13 23:54:30,970 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7178f667c/66d248e4c533425ab07bbcf1b0adc71f/FLAGb0ea0d2bd [2025-04-13 23:54:31,776 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7178f667c/66d248e4c533425ab07bbcf1b0adc71f [2025-04-13 23:54:31,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:54:31,779 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:54:31,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:54:31,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:54:31,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:54:31,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:54:31" (1/1) ... [2025-04-13 23:54:31,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4ee3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:31, skipping insertion in model container [2025-04-13 23:54:31,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:54:31" (1/1) ... [2025-04-13 23:54:31,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:54:32,063 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/45_monabsex1_vs.i[30633,30646] [2025-04-13 23:54:32,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:54:32,078 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:54:32,127 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/45_monabsex1_vs.i[30633,30646] [2025-04-13 23:54:32,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:54:32,149 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:54:32,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32 WrapperNode [2025-04-13 23:54:32,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:54:32,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:54:32,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:54:32,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:54:32,156 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:54:32" (1/1) ... [2025-04-13 23:54:32,166 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:54:32" (1/1) ... [2025-04-13 23:54:32,177 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-04-13 23:54:32,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:54:32,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:54:32,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:54:32,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:54:32,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:54:32,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:54:32,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:54:32,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:54:32,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:54:32,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (1/1) ... [2025-04-13 23:54:32,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:54:32,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:54:32,226 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:54:32,228 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:54:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:54:32,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:54:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:54:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:54:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:54:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:54:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:54:32,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:54:32,246 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:54:32,336 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:54:32,337 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:54:32,421 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:54:32,422 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:54:32,422 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:54:32,485 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:54:32,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:54:32 BoogieIcfgContainer [2025-04-13 23:54:32,486 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:54:32,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:54:32,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:54:32,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:54:32,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:54:31" (1/3) ... [2025-04-13 23:54:32,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46376241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:54:32, skipping insertion in model container [2025-04-13 23:54:32,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:54:32" (2/3) ... [2025-04-13 23:54:32,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46376241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:54:32, skipping insertion in model container [2025-04-13 23:54:32,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:54:32" (3/3) ... [2025-04-13 23:54:32,495 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-04-13 23:54:32,507 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:54:32,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 10 locations, 9 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 23:54:32,509 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:54:32,542 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:54:32,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 24 flow [2025-04-13 23:54:32,584 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 23:54:32,586 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:54:32,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 12 events. 0/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 23:54:32,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 10 transitions, 24 flow [2025-04-13 23:54:32,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 10 transitions, 24 flow [2025-04-13 23:54:32,594 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:54:32,602 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;@6b12cc8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:54:32,602 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:54:32,605 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:54:32,606 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:54:32,606 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:54:32,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:32,606 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-04-13 23:54:32,606 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:54:32,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 96548345, now seen corresponding path program 1 times [2025-04-13 23:54:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:32,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345742913] [2025-04-13 23:54:32,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:32,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:54:32,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:54:32,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:32,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:32,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:54:32,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:54:32,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:54:32,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:32,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:32,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:54:32,730 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:54:32,731 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:54:32,732 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:54:32,732 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:54:32,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:54:32,733 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:54:32,738 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:54:32,738 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:54:32,754 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:54:32,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 42 flow [2025-04-13 23:54:32,760 INFO L116 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-04-13 23:54:32,760 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:54:32,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-04-13 23:54:32,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 16 transitions, 42 flow [2025-04-13 23:54:32,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 42 flow [2025-04-13 23:54:32,763 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:54:32,764 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;@6b12cc8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:54:32,764 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:54:32,770 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:54:32,770 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 23:54:32,770 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:54:32,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:32,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:54:32,770 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:54:32,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -828475583, now seen corresponding path program 1 times [2025-04-13 23:54:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:32,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36228305] [2025-04-13 23:54:32,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:32,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:54:32,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:54:32,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:32,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:32,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:32,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36228305] [2025-04-13 23:54:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36228305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:32,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644261613] [2025-04-13 23:54:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:32,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:32,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:32,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:32,885 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2025-04-13 23:54:32,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:32,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:32,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2025-04-13 23:54:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:32,998 INFO L116 PetriNetUnfolderBase]: 109/215 cut-off events. [2025-04-13 23:54:32,998 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 23:54:33,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 798 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 328. Up to 116 conditions per place. [2025-04-13 23:54:33,002 INFO L140 encePairwiseOnDemand]: 11/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-04-13 23:54:33,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 109 flow [2025-04-13 23:54:33,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-13 23:54:33,011 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-04-13 23:54:33,012 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 42 flow. Second operand 3 states and 29 transitions. [2025-04-13 23:54:33,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 109 flow [2025-04-13 23:54:33,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:54:33,018 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 62 flow [2025-04-13 23:54:33,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2025-04-13 23:54:33,021 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2025-04-13 23:54:33,022 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 62 flow [2025-04-13 23:54:33,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:33,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:33,022 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 23:54:33,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:54:33,022 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:54:33,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash 86798115, now seen corresponding path program 1 times [2025-04-13 23:54:33,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:33,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716461011] [2025-04-13 23:54:33,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:33,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:33,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:54:33,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:54:33,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:33,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:33,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:54:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:54:33,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:54:33,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:33,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:33,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:54:33,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:54:33,048 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:54:33,048 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:54:33,048 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:54:33,048 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:54:33,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:54:33,048 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:54:33,049 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:54:33,049 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:54:33,062 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:54:33,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2025-04-13 23:54:33,070 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-13 23:54:33,071 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:54:33,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-04-13 23:54:33,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 22 transitions, 62 flow [2025-04-13 23:54:33,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-13 23:54:33,072 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:54:33,073 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;@6b12cc8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:54:33,073 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:54:33,075 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:54:33,075 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 23:54:33,075 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:54:33,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:33,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:54:33,075 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:54:33,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -177490596, now seen corresponding path program 1 times [2025-04-13 23:54:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:33,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593751817] [2025-04-13 23:54:33,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:33,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:54:33,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:54:33,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:33,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:33,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593751817] [2025-04-13 23:54:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593751817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:33,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549937312] [2025-04-13 23:54:33,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:33,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:33,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:33,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:33,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2025-04-13 23:54:33,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:33,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:33,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2025-04-13 23:54:33,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:33,341 INFO L116 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2025-04-13 23:54:33,341 INFO L117 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-04-13 23:54:33,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2070 events. 1343/2070 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10039 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 2280. Up to 1272 conditions per place. [2025-04-13 23:54:33,385 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-04-13 23:54:33,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 172 flow [2025-04-13 23:54:33,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 23:54:33,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-04-13 23:54:33,389 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 41 transitions. [2025-04-13 23:54:33,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 172 flow [2025-04-13 23:54:33,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 168 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 23:54:33,391 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 88 flow [2025-04-13 23:54:33,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-04-13 23:54:33,391 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-04-13 23:54:33,391 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 88 flow [2025-04-13 23:54:33,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:33,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:33,393 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:33,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:54:33,393 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:54:33,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1222252108, now seen corresponding path program 1 times [2025-04-13 23:54:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:33,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594107905] [2025-04-13 23:54:33,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:33,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:54:33,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:54:33,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:33,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594107905] [2025-04-13 23:54:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594107905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:33,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:33,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009130647] [2025-04-13 23:54:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:33,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:33,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:33,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:33,428 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2025-04-13 23:54:33,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:33,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:33,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2025-04-13 23:54:33,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:33,627 INFO L116 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2025-04-13 23:54:33,628 INFO L117 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2025-04-13 23:54:33,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13580 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 5575. Up to 1546 conditions per place. [2025-04-13 23:54:33,641 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2025-04-13 23:54:33,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 221 flow [2025-04-13 23:54:33,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 23:54:33,642 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-04-13 23:54:33,642 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 88 flow. Second operand 3 states and 38 transitions. [2025-04-13 23:54:33,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 221 flow [2025-04-13 23:54:33,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:54:33,648 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 128 flow [2025-04-13 23:54:33,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2025-04-13 23:54:33,649 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-04-13 23:54:33,649 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 128 flow [2025-04-13 23:54:33,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:33,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:33,649 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 23:54:33,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:54:33,649 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:54:33,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -765301026, now seen corresponding path program 1 times [2025-04-13 23:54:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:33,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325927068] [2025-04-13 23:54:33,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:33,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:54:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:54:33,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:33,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:33,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:54:33,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:54:33,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:54:33,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:33,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:33,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:54:33,667 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:54:33,668 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:54:33,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:54:33,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:54:33,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:54:33,668 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:54:33,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:54:33,668 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 23:54:33,668 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:54:33,668 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:54:33,683 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:54:33,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 84 flow [2025-04-13 23:54:33,688 INFO L116 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-04-13 23:54:33,689 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:54:33,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 36 events. 0/36 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-04-13 23:54:33,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 28 transitions, 84 flow [2025-04-13 23:54:33,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 84 flow [2025-04-13 23:54:33,690 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:54:33,691 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;@6b12cc8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:54:33,691 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:54:33,692 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:54:33,693 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 23:54:33,693 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:54:33,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:33,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:54:33,693 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:54:33,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 651000092, now seen corresponding path program 1 times [2025-04-13 23:54:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:33,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082731377] [2025-04-13 23:54:33,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:33,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:54:33,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:54:33,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:33,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:33,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:33,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082731377] [2025-04-13 23:54:33,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082731377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:33,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:33,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179674365] [2025-04-13 23:54:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:33,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:33,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:33,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:33,723 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 23:54:33,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:33,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:33,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 23:54:33,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:34,576 INFO L116 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2025-04-13 23:54:34,577 INFO L117 PetriNetUnfolderBase]: For 3653/3653 co-relation queries the response was YES. [2025-04-13 23:54:34,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35374 conditions, 16840 events. 12243/16840 cut-off events. For 3653/3653 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90109 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 5360. Up to 10936 conditions per place. [2025-04-13 23:54:34,671 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-13 23:54:34,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 239 flow [2025-04-13 23:54:34,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-13 23:54:34,673 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-04-13 23:54:34,673 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 84 flow. Second operand 3 states and 53 transitions. [2025-04-13 23:54:34,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 239 flow [2025-04-13 23:54:34,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 227 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 23:54:34,676 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 114 flow [2025-04-13 23:54:34,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-04-13 23:54:34,676 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-04-13 23:54:34,677 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 114 flow [2025-04-13 23:54:34,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:34,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:34,677 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:34,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:54:34,677 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:54:34,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1466730329, now seen corresponding path program 1 times [2025-04-13 23:54:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:34,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769266351] [2025-04-13 23:54:34,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:34,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:54:34,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:54:34,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:34,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:34,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:34,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769266351] [2025-04-13 23:54:34,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769266351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:34,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:34,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635030579] [2025-04-13 23:54:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:34,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:34,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:34,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:34,708 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 23:54:34,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:34,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:34,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 23:54:34,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:35,847 INFO L116 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2025-04-13 23:54:35,847 INFO L117 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2025-04-13 23:54:35,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55876 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 133439 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 49761. Up to 15062 conditions per place. [2025-04-13 23:54:36,001 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-04-13 23:54:36,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 300 flow [2025-04-13 23:54:36,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-04-13 23:54:36,003 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-04-13 23:54:36,003 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 114 flow. Second operand 3 states and 50 transitions. [2025-04-13 23:54:36,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 300 flow [2025-04-13 23:54:36,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:54:36,054 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 172 flow [2025-04-13 23:54:36,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-04-13 23:54:36,057 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-04-13 23:54:36,057 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 172 flow [2025-04-13 23:54:36,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:36,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:36,057 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:36,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:54:36,058 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:54:36,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash -795923075, now seen corresponding path program 1 times [2025-04-13 23:54:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:36,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078599624] [2025-04-13 23:54:36,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:36,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:36,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:54:36,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:54:36,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:36,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:36,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078599624] [2025-04-13 23:54:36,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078599624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:36,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:36,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370585375] [2025-04-13 23:54:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:36,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:36,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:36,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:36,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 23:54:36,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:36,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:36,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 23:54:36,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:37,253 INFO L116 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2025-04-13 23:54:37,253 INFO L117 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2025-04-13 23:54:37,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79820 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185251 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 71245. Up to 19502 conditions per place. [2025-04-13 23:54:37,408 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2025-04-13 23:54:37,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 409 flow [2025-04-13 23:54:37,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 23:54:37,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 23:54:37,409 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 172 flow. Second operand 3 states and 49 transitions. [2025-04-13 23:54:37,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 409 flow [2025-04-13 23:54:37,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:54:37,463 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 278 flow [2025-04-13 23:54:37,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2025-04-13 23:54:37,464 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-04-13 23:54:37,464 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 278 flow [2025-04-13 23:54:37,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:37,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:37,464 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:37,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:54:37,465 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:54:37,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1115803943, now seen corresponding path program 1 times [2025-04-13 23:54:37,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:37,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772795278] [2025-04-13 23:54:37,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:37,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:37,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:54:37,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:54:37,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:37,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:37,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:37,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772795278] [2025-04-13 23:54:37,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772795278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:37,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:37,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:54:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075698781] [2025-04-13 23:54:37,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:37,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:54:37,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:37,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:54:37,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:54:37,625 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 23:54:37,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:37,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:37,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 23:54:37,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:39,926 INFO L116 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2025-04-13 23:54:39,926 INFO L117 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2025-04-13 23:54:40,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150159 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 356733 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150074. Up to 16776 conditions per place. [2025-04-13 23:54:40,204 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2025-04-13 23:54:40,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 147 transitions, 1084 flow [2025-04-13 23:54:40,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:54:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:54:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-13 23:54:40,208 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-04-13 23:54:40,208 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 278 flow. Second operand 6 states and 114 transitions. [2025-04-13 23:54:40,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 147 transitions, 1084 flow [2025-04-13 23:54:40,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:54:40,359 INFO L231 Difference]: Finished difference. Result has 51 places, 70 transitions, 575 flow [2025-04-13 23:54:40,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=51, PETRI_TRANSITIONS=70} [2025-04-13 23:54:40,359 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-04-13 23:54:40,360 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 70 transitions, 575 flow [2025-04-13 23:54:40,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:40,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:40,360 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:40,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:54:40,360 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:54:40,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -778752413, now seen corresponding path program 2 times [2025-04-13 23:54:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:40,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848254604] [2025-04-13 23:54:40,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:54:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:40,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:54:40,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:54:40,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:54:40,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:40,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848254604] [2025-04-13 23:54:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848254604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:40,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:40,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:54:40,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793170426] [2025-04-13 23:54:40,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:40,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:54:40,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:40,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:54:40,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:54:40,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 23:54:40,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:40,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:40,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 23:54:40,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:43,326 INFO L116 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2025-04-13 23:54:43,326 INFO L117 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2025-04-13 23:54:43,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183311 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404923 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 96155. Up to 19534 conditions per place. [2025-04-13 23:54:43,675 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2025-04-13 23:54:43,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 179 transitions, 1515 flow [2025-04-13 23:54:43,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:54:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 23:54:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-04-13 23:54:43,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-04-13 23:54:43,680 INFO L175 Difference]: Start difference. First operand has 51 places, 70 transitions, 575 flow. Second operand 7 states and 128 transitions. [2025-04-13 23:54:43,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 179 transitions, 1515 flow [2025-04-13 23:54:43,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:54:43,942 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 1039 flow [2025-04-13 23:54:43,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=61, PETRI_TRANSITIONS=95} [2025-04-13 23:54:43,943 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-04-13 23:54:43,943 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 1039 flow [2025-04-13 23:54:43,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:43,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:43,943 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:43,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:54:43,943 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:54:43,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1096091370, now seen corresponding path program 1 times [2025-04-13 23:54:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:43,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018613510] [2025-04-13 23:54:43,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:43,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:54:43,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:54:43,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:43,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:43,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:54:43,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:54:43,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:54:43,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:43,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:54:43,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:54:43,957 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:54:43,958 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:54:43,958 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:54:43,958 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:54:43,958 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:54:43,958 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:54:43,958 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:54:43,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:54:43,958 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-04-13 23:54:43,959 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:54:43,959 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:54:43,978 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:54:43,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 108 flow [2025-04-13 23:54:43,983 INFO L116 PetriNetUnfolderBase]: 0/44 cut-off events. [2025-04-13 23:54:43,983 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:54:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 44 events. 0/44 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-04-13 23:54:43,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 34 transitions, 108 flow [2025-04-13 23:54:43,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 108 flow [2025-04-13 23:54:43,985 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:54:43,985 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;@6b12cc8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:54:43,985 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:54:43,986 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:54:43,986 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 23:54:43,986 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:54:43,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:43,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:54:43,986 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:54:43,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1656981586, now seen corresponding path program 1 times [2025-04-13 23:54:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:43,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332451700] [2025-04-13 23:54:43,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:54:43,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:54:43,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:43,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:44,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332451700] [2025-04-13 23:54:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332451700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653074967] [2025-04-13 23:54:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:44,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:44,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:44,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:44,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:44,016 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 23:54:44,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:44,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:44,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 23:54:44,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:48,445 INFO L116 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2025-04-13 23:54:48,445 INFO L117 PetriNetUnfolderBase]: For 36230/36230 co-relation queries the response was YES. [2025-04-13 23:54:48,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264858 conditions, 126043 events. 97851/126043 cut-off events. For 36230/36230 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 716075 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 35315. Up to 84136 conditions per place. [2025-04-13 23:54:49,069 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-04-13 23:54:49,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 310 flow [2025-04-13 23:54:49,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-13 23:54:49,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2025-04-13 23:54:49,070 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 108 flow. Second operand 3 states and 65 transitions. [2025-04-13 23:54:49,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 310 flow [2025-04-13 23:54:49,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 286 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-13 23:54:49,079 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 140 flow [2025-04-13 23:54:49,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-13 23:54:49,079 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-04-13 23:54:49,079 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 140 flow [2025-04-13 23:54:49,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:49,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:49,080 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:49,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:54:49,080 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:54:49,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1081249682, now seen corresponding path program 1 times [2025-04-13 23:54:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:49,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333444328] [2025-04-13 23:54:49,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:49,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:54:49,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:54:49,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:49,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:49,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333444328] [2025-04-13 23:54:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333444328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:49,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:49,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885504425] [2025-04-13 23:54:49,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:49,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:49,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:49,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:49,097 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 23:54:49,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:49,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:49,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 23:54:49,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:54:56,089 INFO L116 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2025-04-13 23:54:56,089 INFO L117 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2025-04-13 23:54:56,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429056 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1083775 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 382197. Up to 121118 conditions per place. [2025-04-13 23:54:57,237 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2025-04-13 23:54:57,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 379 flow [2025-04-13 23:54:57,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:54:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:54:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-13 23:54:57,246 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-04-13 23:54:57,246 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 140 flow. Second operand 3 states and 62 transitions. [2025-04-13 23:54:57,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 379 flow [2025-04-13 23:54:58,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:54:58,456 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 216 flow [2025-04-13 23:54:58,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-04-13 23:54:58,457 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2025-04-13 23:54:58,457 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 216 flow [2025-04-13 23:54:58,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:58,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:54:58,457 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:54:58,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:54:58,457 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:54:58,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:54:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash 298265304, now seen corresponding path program 1 times [2025-04-13 23:54:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:54:58,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501036134] [2025-04-13 23:54:58,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:54:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:54:58,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:54:58,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:54:58,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:54:58,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:54:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:54:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:54:58,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501036134] [2025-04-13 23:54:58,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501036134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:54:58,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:54:58,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:54:58,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828186593] [2025-04-13 23:54:58,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:54:58,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:54:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:54:58,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:54:58,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:54:58,484 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 23:54:58,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:54:58,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:54:58,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 23:54:58,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:55:08,354 INFO L116 PetriNetUnfolderBase]: 196129/254181 cut-off events. [2025-04-13 23:55:08,355 INFO L117 PetriNetUnfolderBase]: For 186455/186455 co-relation queries the response was YES. [2025-04-13 23:55:08,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651913 conditions, 254181 events. 196129/254181 cut-off events. For 186455/186455 co-relation queries the response was YES. Maximal size of possible extension queue 7578. Compared 1584360 event pairs, 98961 based on Foata normal form. 0/223119 useless extension candidates. Maximal degree in co-relation 579637. Up to 169070 conditions per place. [2025-04-13 23:55:09,822 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 63 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2025-04-13 23:55:09,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 532 flow [2025-04-13 23:55:09,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:55:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:55:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-13 23:55:09,823 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2025-04-13 23:55:09,824 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 216 flow. Second operand 3 states and 61 transitions. [2025-04-13 23:55:09,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 532 flow [2025-04-13 23:55:11,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:55:11,569 INFO L231 Difference]: Finished difference. Result has 52 places, 59 transitions, 366 flow [2025-04-13 23:55:11,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=52, PETRI_TRANSITIONS=59} [2025-04-13 23:55:11,570 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2025-04-13 23:55:11,570 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 366 flow [2025-04-13 23:55:11,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:55:11,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:55:11,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:55:11,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:55:11,570 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:55:11,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:55:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -303612194, now seen corresponding path program 1 times [2025-04-13 23:55:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:55:11,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214059763] [2025-04-13 23:55:11,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:55:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:55:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:55:11,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:55:11,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:55:11,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:55:11,707 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:55:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:55:11,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214059763] [2025-04-13 23:55:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214059763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:55:11,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:55:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:55:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134648973] [2025-04-13 23:55:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:55:11,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:55:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:55:11,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:55:11,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:55:11,708 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 23:55:11,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:55:11,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:55:11,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 23:55:11,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:55:29,418 INFO L116 PetriNetUnfolderBase]: 338673/440445 cut-off events. [2025-04-13 23:55:29,418 INFO L117 PetriNetUnfolderBase]: For 450437/450437 co-relation queries the response was YES. [2025-04-13 23:55:30,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232962 conditions, 440445 events. 338673/440445 cut-off events. For 450437/450437 co-relation queries the response was YES. Maximal size of possible extension queue 13514. Compared 2999010 event pairs, 47625 based on Foata normal form. 0/388515 useless extension candidates. Maximal degree in co-relation 1232856. Up to 141454 conditions per place. [2025-04-13 23:55:32,271 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 148 selfloop transitions, 43 changer transitions 0/192 dead transitions. [2025-04-13 23:55:32,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 192 transitions, 1430 flow [2025-04-13 23:55:32,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:55:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:55:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-04-13 23:55:32,272 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-04-13 23:55:32,273 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 366 flow. Second operand 6 states and 144 transitions. [2025-04-13 23:55:32,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 192 transitions, 1430 flow [2025-04-13 23:55:44,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 192 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:55:44,886 INFO L231 Difference]: Finished difference. Result has 59 places, 89 transitions, 747 flow [2025-04-13 23:55:44,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=59, PETRI_TRANSITIONS=89} [2025-04-13 23:55:44,886 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2025-04-13 23:55:44,886 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 89 transitions, 747 flow [2025-04-13 23:55:44,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:55:44,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:55:44,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:55:44,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 23:55:44,887 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:55:44,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:55:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash 301270036, now seen corresponding path program 2 times [2025-04-13 23:55:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:55:44,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593423853] [2025-04-13 23:55:44,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:55:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:55:44,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:55:44,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:55:44,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:55:44,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:55:44,926 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:55:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:55:44,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593423853] [2025-04-13 23:55:44,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593423853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:55:44,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:55:44,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:55:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314521362] [2025-04-13 23:55:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:55:44,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:55:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:55:44,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:55:44,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:55:44,927 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 23:55:44,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 89 transitions, 747 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:55:44,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:55:44,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 23:55:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand