/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-theta/unwind3-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:08:24,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:08:24,069 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 21:08:24,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:08:24,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:08:24,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:08:24,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:08:24,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:08:24,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:08:24,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:08:24,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:08:24,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:08:24,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:08:24,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:08:24,090 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:08:24,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:08:24,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:08:24,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:24,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:24,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:08:24,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:08:24,092 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 [2025-04-13 21:08:24,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:08:24,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:08:24,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:08:24,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:08:24,325 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:08:24,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind3-100.i [2025-04-13 21:08:25,608 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13829a248/f42effa2e2d444389b1c74fdc1c9cb7e/FLAG7b7b3c747 [2025-04-13 21:08:25,823 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:08:25,824 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind3-100.i [2025-04-13 21:08:25,838 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13829a248/f42effa2e2d444389b1c74fdc1c9cb7e/FLAG7b7b3c747 [2025-04-13 21:08:26,658 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13829a248/f42effa2e2d444389b1c74fdc1c9cb7e [2025-04-13 21:08:26,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:08:26,661 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:08:26,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:08:26,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:08:26,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:08:26,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:08:26" (1/1) ... [2025-04-13 21:08:26,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d373ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:26, skipping insertion in model container [2025-04-13 21:08:26,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:08:26" (1/1) ... [2025-04-13 21:08:26,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:08:26,986 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-theta/unwind3-100.i[33026,33039] [2025-04-13 21:08:27,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:08:27,015 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:08:27,057 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-theta/unwind3-100.i[33026,33039] [2025-04-13 21:08:27,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:08:27,080 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:08:27,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27 WrapperNode [2025-04-13 21:08:27,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:08:27,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:08:27,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:08:27,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:08:27,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,106 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 21:08:27,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:08:27,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:08:27,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:08:27,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:08:27,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,120 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 21:08:27,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:08:27,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:08:27,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:08:27,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:08:27,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (1/1) ... [2025-04-13 21:08:27,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:27,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:27,152 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 21:08:27,154 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 21:08:27,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:08:27,169 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 21:08:27,169 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 21:08:27,169 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 21:08:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 21:08:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:08:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:08:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:08:27,171 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:08:27,263 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:08:27,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:08:27,346 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:08:27,347 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:08:27,347 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:08:27,425 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:08:27,429 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:08:27,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:08:27 BoogieIcfgContainer [2025-04-13 21:08:27,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:08:27,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:08:27,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:08:27,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:08:27,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:08:26" (1/3) ... [2025-04-13 21:08:27,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670be0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:08:27, skipping insertion in model container [2025-04-13 21:08:27,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:27" (2/3) ... [2025-04-13 21:08:27,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670be0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:08:27, skipping insertion in model container [2025-04-13 21:08:27,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:08:27" (3/3) ... [2025-04-13 21:08:27,438 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-04-13 21:08:27,449 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:08:27,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 16 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 21:08:27,451 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:08:27,481 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:08:27,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 44 flow [2025-04-13 21:08:27,531 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-13 21:08:27,532 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:08:27,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 13. Up to 4 conditions per place. [2025-04-13 21:08:27,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 18 transitions, 44 flow [2025-04-13 21:08:27,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 39 flow [2025-04-13 21:08:27,547 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:27,558 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;@3ad2fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:27,558 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 21:08:27,566 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:27,566 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-13 21:08:27,566 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:08:27,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:27,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:27,568 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:08:27,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1554290362, now seen corresponding path program 1 times [2025-04-13 21:08:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:27,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152600172] [2025-04-13 21:08:27,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:27,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:27,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:27,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:27,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:27,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:27,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:27,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:27,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:27,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:27,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:27,688 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:27,689 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 21:08:27,690 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 21:08:27,690 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 21:08:27,690 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 21:08:27,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:08:27,691 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 21:08:27,695 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:08:27,696 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 21:08:27,712 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:08:27,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 74 flow [2025-04-13 21:08:27,724 INFO L116 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-04-13 21:08:27,724 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:08:27,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 35 events. 3/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 46. Up to 6 conditions per place. [2025-04-13 21:08:27,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 27 transitions, 74 flow [2025-04-13 21:08:27,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 20 transitions, 53 flow [2025-04-13 21:08:27,729 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:27,729 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;@3ad2fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:27,730 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 21:08:27,733 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:27,733 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-13 21:08:27,733 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:08:27,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:27,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:27,734 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:08:27,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:27,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1941888531, now seen corresponding path program 1 times [2025-04-13 21:08:27,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:27,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229318698] [2025-04-13 21:08:27,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:27,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:27,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:27,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:27,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:27,864 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 21:08:27,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:27,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229318698] [2025-04-13 21:08:27,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229318698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:27,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:27,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044584420] [2025-04-13 21:08:27,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:27,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:27,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:27,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:27,894 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-04-13 21:08:27,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21:08:27,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:27,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-04-13 21:08:27,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:27,979 INFO L116 PetriNetUnfolderBase]: 166/293 cut-off events. [2025-04-13 21:08:27,979 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 21:08:27,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 293 events. 166/293 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1167 event pairs, 142 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 173. Up to 276 conditions per place. [2025-04-13 21:08:27,985 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 14 selfloop transitions, 1 changer transitions 0/19 dead transitions. [2025-04-13 21:08:27,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 81 flow [2025-04-13 21:08:27,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-13 21:08:27,993 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38271604938271603 [2025-04-13 21:08:27,994 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 53 flow. Second operand 3 states and 31 transitions. [2025-04-13 21:08:27,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 81 flow [2025-04-13 21:08:27,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:27,998 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 52 flow [2025-04-13 21:08:28,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2025-04-13 21:08:28,002 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2025-04-13 21:08:28,002 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 52 flow [2025-04-13 21:08:28,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21:08:28,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:28,003 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:28,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:08:28,003 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:08:28,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2129576935, now seen corresponding path program 1 times [2025-04-13 21:08:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:28,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620181071] [2025-04-13 21:08:28,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:28,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:28,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:28,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:28,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:28,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:28,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:28,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:28,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:28,027 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 21:08:28,027 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 21:08:28,027 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 21:08:28,027 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 21:08:28,027 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 21:08:28,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:08:28,027 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 21:08:28,028 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:08:28,028 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 21:08:28,052 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:08:28,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 108 flow [2025-04-13 21:08:28,062 INFO L116 PetriNetUnfolderBase]: 4/47 cut-off events. [2025-04-13 21:08:28,062 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 21:08:28,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 47 events. 4/47 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 64. Up to 8 conditions per place. [2025-04-13 21:08:28,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 36 transitions, 108 flow [2025-04-13 21:08:28,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 24 transitions, 69 flow [2025-04-13 21:08:28,064 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:28,064 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;@3ad2fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:28,064 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:08:28,068 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:28,068 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-13 21:08:28,068 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:08:28,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:28,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:28,068 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:28,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash -876877164, now seen corresponding path program 1 times [2025-04-13 21:08:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:28,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209637928] [2025-04-13 21:08:28,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:28,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:28,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:28,122 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 21:08:28,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:28,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209637928] [2025-04-13 21:08:28,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209637928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:28,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:28,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:28,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108669808] [2025-04-13 21:08:28,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:28,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:28,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:28,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:28,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-13 21:08:28,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:28,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:28,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-13 21:08:28,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:28,250 INFO L116 PetriNetUnfolderBase]: 742/1199 cut-off events. [2025-04-13 21:08:28,250 INFO L117 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-04-13 21:08:28,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 1199 events. 742/1199 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5924 event pairs, 664 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 688. Up to 1095 conditions per place. [2025-04-13 21:08:28,259 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 17 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2025-04-13 21:08:28,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 103 flow [2025-04-13 21:08:28,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 21:08:28,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3425925925925926 [2025-04-13 21:08:28,262 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 37 transitions. [2025-04-13 21:08:28,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 103 flow [2025-04-13 21:08:28,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 100 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:28,264 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 66 flow [2025-04-13 21:08:28,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2025-04-13 21:08:28,264 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-04-13 21:08:28,264 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 66 flow [2025-04-13 21:08:28,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:28,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:28,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:28,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:08:28,265 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:28,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash -890940328, now seen corresponding path program 1 times [2025-04-13 21:08:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:28,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095980100] [2025-04-13 21:08:28,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:28,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:28,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:28,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:28,308 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 21:08:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:28,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095980100] [2025-04-13 21:08:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095980100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:28,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:08:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186793115] [2025-04-13 21:08:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:28,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:28,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:28,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:28,315 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-13 21:08:28,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 21:08:28,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:28,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-13 21:08:28,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:28,435 INFO L116 PetriNetUnfolderBase]: 716/1104 cut-off events. [2025-04-13 21:08:28,435 INFO L117 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-04-13 21:08:28,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1104 events. 716/1104 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5111 event pairs, 426 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2260. Up to 1044 conditions per place. [2025-04-13 21:08:28,441 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 18 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-04-13 21:08:28,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 114 flow [2025-04-13 21:08:28,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-13 21:08:28,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2025-04-13 21:08:28,443 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 66 flow. Second operand 4 states and 46 transitions. [2025-04-13 21:08:28,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 114 flow [2025-04-13 21:08:28,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 113 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:28,444 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 79 flow [2025-04-13 21:08:28,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-04-13 21:08:28,445 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2025-04-13 21:08:28,445 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 79 flow [2025-04-13 21:08:28,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 21:08:28,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:28,445 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:28,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:08:28,445 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:28,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1519840251, now seen corresponding path program 1 times [2025-04-13 21:08:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:28,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5785378] [2025-04-13 21:08:28,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:28,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:28,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:28,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:28,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:28,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:28,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:28,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:28,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:28,461 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:28,461 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 21:08:28,461 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 21:08:28,461 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 21:08:28,462 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 21:08:28,462 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 21:08:28,462 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:08:28,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:08:28,462 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 21:08:28,462 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:08:28,462 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 21:08:28,494 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:08:28,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 146 flow [2025-04-13 21:08:28,501 INFO L116 PetriNetUnfolderBase]: 5/59 cut-off events. [2025-04-13 21:08:28,501 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 21:08:28,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 59 events. 5/59 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 189 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 83. Up to 10 conditions per place. [2025-04-13 21:08:28,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 146 flow [2025-04-13 21:08:28,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 28 transitions, 87 flow [2025-04-13 21:08:28,503 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:28,503 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;@3ad2fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:28,503 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 21:08:28,504 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:28,504 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-13 21:08:28,504 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:08:28,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:28,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:28,506 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 21:08:28,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash 454385435, now seen corresponding path program 1 times [2025-04-13 21:08:28,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:28,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091794302] [2025-04-13 21:08:28,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:28,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:28,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:28,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:28,525 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 21:08:28,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:28,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091794302] [2025-04-13 21:08:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091794302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:28,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955134203] [2025-04-13 21:08:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:28,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:28,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2025-04-13 21:08:28,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:28,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:28,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2025-04-13 21:08:28,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:28,796 INFO L116 PetriNetUnfolderBase]: 2956/4403 cut-off events. [2025-04-13 21:08:28,796 INFO L117 PetriNetUnfolderBase]: For 522/522 co-relation queries the response was YES. [2025-04-13 21:08:28,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8870 conditions, 4403 events. 2956/4403 cut-off events. For 522/522 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24406 event pairs, 2716 based on Foata normal form. 0/4023 useless extension candidates. Maximal degree in co-relation 2596. Up to 4038 conditions per place. [2025-04-13 21:08:28,815 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 20 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-13 21:08:28,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 127 flow [2025-04-13 21:08:28,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-04-13 21:08:28,817 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2025-04-13 21:08:28,817 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 87 flow. Second operand 3 states and 43 transitions. [2025-04-13 21:08:28,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 127 flow [2025-04-13 21:08:28,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 120 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:28,821 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 80 flow [2025-04-13 21:08:28,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2025-04-13 21:08:28,822 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-04-13 21:08:28,822 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 80 flow [2025-04-13 21:08:28,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:28,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:28,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:28,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:08:28,823 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 21:08:28,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1447243129, now seen corresponding path program 1 times [2025-04-13 21:08:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:28,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302654295] [2025-04-13 21:08:28,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:28,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:28,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:28,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:28,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:28,866 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 21:08:28,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:28,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302654295] [2025-04-13 21:08:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302654295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:08:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502588149] [2025-04-13 21:08:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:28,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:28,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:28,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:28,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2025-04-13 21:08:28,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 21:08:28,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:28,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2025-04-13 21:08:28,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:29,175 INFO L116 PetriNetUnfolderBase]: 2930/4302 cut-off events. [2025-04-13 21:08:29,175 INFO L117 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2025-04-13 21:08:29,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8654 conditions, 4302 events. 2930/4302 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 23035 event pairs, 1992 based on Foata normal form. 0/3918 useless extension candidates. Maximal degree in co-relation 8644. Up to 3987 conditions per place. [2025-04-13 21:08:29,201 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2025-04-13 21:08:29,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 134 flow [2025-04-13 21:08:29,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-13 21:08:29,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2025-04-13 21:08:29,203 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 80 flow. Second operand 4 states and 53 transitions. [2025-04-13 21:08:29,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 134 flow [2025-04-13 21:08:29,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:29,205 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 93 flow [2025-04-13 21:08:29,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2025-04-13 21:08:29,207 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2025-04-13 21:08:29,207 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 93 flow [2025-04-13 21:08:29,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 21:08:29,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:29,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:29,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:08:29,207 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 21:08:29,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash 744698484, now seen corresponding path program 1 times [2025-04-13 21:08:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:29,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660854461] [2025-04-13 21:08:29,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:29,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:29,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:29,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:29,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:29,314 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 21:08:29,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:29,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660854461] [2025-04-13 21:08:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660854461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554526094] [2025-04-13 21:08:29,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:29,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:29,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:29,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:29,318 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2025-04-13 21:08:29,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 21:08:29,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:29,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2025-04-13 21:08:29,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:29,635 INFO L116 PetriNetUnfolderBase]: 3611/5169 cut-off events. [2025-04-13 21:08:29,635 INFO L117 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2025-04-13 21:08:29,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10679 conditions, 5169 events. 3611/5169 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27573 event pairs, 2696 based on Foata normal form. 0/4739 useless extension candidates. Maximal degree in co-relation 10667. Up to 3991 conditions per place. [2025-04-13 21:08:29,661 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 29 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-04-13 21:08:29,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 177 flow [2025-04-13 21:08:29,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-13 21:08:29,664 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 21:08:29,664 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 93 flow. Second operand 4 states and 60 transitions. [2025-04-13 21:08:29,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 177 flow [2025-04-13 21:08:29,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:29,666 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 103 flow [2025-04-13 21:08:29,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2025-04-13 21:08:29,667 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-04-13 21:08:29,668 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 103 flow [2025-04-13 21:08:29,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 21:08:29,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:29,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:29,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:08:29,668 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 21:08:29,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1610816801, now seen corresponding path program 1 times [2025-04-13 21:08:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:29,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679299473] [2025-04-13 21:08:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:29,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:29,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:29,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:29,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:29,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:29,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679299473] [2025-04-13 21:08:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679299473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:29,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:29,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213826112] [2025-04-13 21:08:29,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:29,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:08:29,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:29,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:08:29,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:08:29,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2025-04-13 21:08:29,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 21:08:29,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:29,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2025-04-13 21:08:29,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:30,006 INFO L116 PetriNetUnfolderBase]: 3458/4830 cut-off events. [2025-04-13 21:08:30,006 INFO L117 PetriNetUnfolderBase]: For 876/876 co-relation queries the response was YES. [2025-04-13 21:08:30,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11157 conditions, 4830 events. 3458/4830 cut-off events. For 876/876 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 24606 event pairs, 2037 based on Foata normal form. 0/4440 useless extension candidates. Maximal degree in co-relation 11144. Up to 4648 conditions per place. [2025-04-13 21:08:30,036 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 26 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-04-13 21:08:30,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 179 flow [2025-04-13 21:08:30,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:08:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:08:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-13 21:08:30,041 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2025-04-13 21:08:30,041 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 103 flow. Second operand 5 states and 65 transitions. [2025-04-13 21:08:30,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 179 flow [2025-04-13 21:08:30,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:30,051 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 115 flow [2025-04-13 21:08:30,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2025-04-13 21:08:30,052 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-04-13 21:08:30,052 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 115 flow [2025-04-13 21:08:30,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 21:08:30,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:30,052 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:30,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:08:30,052 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 21:08:30,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1627453388, now seen corresponding path program 1 times [2025-04-13 21:08:30,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:30,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885804784] [2025-04-13 21:08:30,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:30,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:30,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:08:30,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:08:30,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:30,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:30,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:30,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:08:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:08:30,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:30,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:30,078 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:30,078 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 21:08:30,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-13 21:08:30,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 21:08:30,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 21:08:30,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 21:08:30,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 21:08:30,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 21:08:30,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:08:30,078 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 21:08:30,079 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:08:30,079 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 21:08:30,108 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:08:30,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 54 transitions, 188 flow [2025-04-13 21:08:30,118 INFO L116 PetriNetUnfolderBase]: 6/71 cut-off events. [2025-04-13 21:08:30,118 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 21:08:30,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 71 events. 6/71 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 242 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 103. Up to 12 conditions per place. [2025-04-13 21:08:30,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 54 transitions, 188 flow [2025-04-13 21:08:30,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 32 transitions, 107 flow [2025-04-13 21:08:30,119 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:30,119 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;@3ad2fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:30,119 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 21:08:30,121 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:30,121 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-13 21:08:30,121 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:08:30,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:30,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:30,121 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:08:30,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2051898754, now seen corresponding path program 1 times [2025-04-13 21:08:30,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:30,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808992247] [2025-04-13 21:08:30,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:30,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:30,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:30,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:30,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:30,143 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 21:08:30,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:30,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808992247] [2025-04-13 21:08:30,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808992247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:30,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:30,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491912389] [2025-04-13 21:08:30,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:30,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:30,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:30,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:30,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-04-13 21:08:30,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 21:08:30,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:30,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-04-13 21:08:30,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:30,902 INFO L116 PetriNetUnfolderBase]: 11056/15473 cut-off events. [2025-04-13 21:08:30,903 INFO L117 PetriNetUnfolderBase]: For 2412/2412 co-relation queries the response was YES. [2025-04-13 21:08:30,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31200 conditions, 15473 events. 11056/15473 cut-off events. For 2412/2412 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 92070 event pairs, 10330 based on Foata normal form. 0/14337 useless extension candidates. Maximal degree in co-relation 9373. Up to 14325 conditions per place. [2025-04-13 21:08:30,974 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 23 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2025-04-13 21:08:30,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 153 flow [2025-04-13 21:08:30,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 21:08:30,976 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30246913580246915 [2025-04-13 21:08:30,976 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 107 flow. Second operand 3 states and 49 transitions. [2025-04-13 21:08:30,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 153 flow [2025-04-13 21:08:30,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 140 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:30,987 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 94 flow [2025-04-13 21:08:30,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2025-04-13 21:08:30,989 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-04-13 21:08:30,989 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 94 flow [2025-04-13 21:08:30,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 21:08:30,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:30,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:30,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:08:30,989 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:08:30,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 460694454, now seen corresponding path program 1 times [2025-04-13 21:08:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:30,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434316675] [2025-04-13 21:08:30,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:30,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:30,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:30,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:30,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:31,026 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 21:08:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:31,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434316675] [2025-04-13 21:08:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434316675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:31,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:08:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548678806] [2025-04-13 21:08:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:31,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:31,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:31,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:31,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-04-13 21:08:31,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 21:08:31,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:31,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-04-13 21:08:31,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:31,745 INFO L116 PetriNetUnfolderBase]: 11030/15372 cut-off events. [2025-04-13 21:08:31,745 INFO L117 PetriNetUnfolderBase]: For 1076/1076 co-relation queries the response was YES. [2025-04-13 21:08:31,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30741 conditions, 15372 events. 11030/15372 cut-off events. For 1076/1076 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 90055 event pairs, 9228 based on Foata normal form. 0/14232 useless extension candidates. Maximal degree in co-relation 30730. Up to 14274 conditions per place. [2025-04-13 21:08:31,801 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 24 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-04-13 21:08:31,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 154 flow [2025-04-13 21:08:31,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-13 21:08:31,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-04-13 21:08:31,802 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 94 flow. Second operand 4 states and 60 transitions. [2025-04-13 21:08:31,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 154 flow [2025-04-13 21:08:31,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:31,804 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 107 flow [2025-04-13 21:08:31,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2025-04-13 21:08:31,805 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-04-13 21:08:31,805 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 107 flow [2025-04-13 21:08:31,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 21:08:31,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:31,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:31,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 21:08:31,806 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:08:31,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash 322643051, now seen corresponding path program 1 times [2025-04-13 21:08:31,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:31,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708410557] [2025-04-13 21:08:31,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:31,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:31,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:31,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:31,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:31,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:31,875 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 21:08:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:31,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708410557] [2025-04-13 21:08:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708410557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:31,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:31,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12530643] [2025-04-13 21:08:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:31,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:31,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:31,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:31,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:31,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-04-13 21:08:31,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 21:08:31,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:31,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-04-13 21:08:31,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:32,662 INFO L116 PetriNetUnfolderBase]: 13574/18583 cut-off events. [2025-04-13 21:08:32,662 INFO L117 PetriNetUnfolderBase]: For 1323/1323 co-relation queries the response was YES. [2025-04-13 21:08:32,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37945 conditions, 18583 events. 13574/18583 cut-off events. For 1323/1323 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 108410 event pairs, 10310 based on Foata normal form. 0/17397 useless extension candidates. Maximal degree in co-relation 37932. Up to 14278 conditions per place. [2025-04-13 21:08:32,751 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 34 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-04-13 21:08:32,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 205 flow [2025-04-13 21:08:32,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-13 21:08:32,752 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2025-04-13 21:08:32,752 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 107 flow. Second operand 4 states and 69 transitions. [2025-04-13 21:08:32,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 205 flow [2025-04-13 21:08:32,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:32,755 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 117 flow [2025-04-13 21:08:32,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2025-04-13 21:08:32,756 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-04-13 21:08:32,756 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 117 flow [2025-04-13 21:08:32,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 21:08:32,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:32,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:32,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 21:08:32,756 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:08:32,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1412000319, now seen corresponding path program 1 times [2025-04-13 21:08:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:32,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266744993] [2025-04-13 21:08:32,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:32,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:32,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:32,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:32,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:32,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:32,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266744993] [2025-04-13 21:08:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266744993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:32,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:32,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866463488] [2025-04-13 21:08:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:32,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:08:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:32,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:08:32,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:08:32,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-04-13 21:08:32,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:32,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:32,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-04-13 21:08:32,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:33,755 INFO L116 PetriNetUnfolderBase]: 13421/18239 cut-off events. [2025-04-13 21:08:33,755 INFO L117 PetriNetUnfolderBase]: For 3966/3966 co-relation queries the response was YES. [2025-04-13 21:08:33,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40848 conditions, 18239 events. 13421/18239 cut-off events. For 3966/3966 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 103248 event pairs, 8841 based on Foata normal form. 0/16925 useless extension candidates. Maximal degree in co-relation 40834. Up to 17284 conditions per place. [2025-04-13 21:08:33,833 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 29 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-04-13 21:08:33,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 40 transitions, 199 flow [2025-04-13 21:08:33,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:08:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:08:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-13 21:08:33,834 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27037037037037037 [2025-04-13 21:08:33,834 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 117 flow. Second operand 5 states and 73 transitions. [2025-04-13 21:08:33,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 40 transitions, 199 flow [2025-04-13 21:08:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 193 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:33,862 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 129 flow [2025-04-13 21:08:33,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-04-13 21:08:33,863 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2025-04-13 21:08:33,863 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 129 flow [2025-04-13 21:08:33,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:33,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:33,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:33,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 21:08:33,863 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:08:33,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -965015031, now seen corresponding path program 1 times [2025-04-13 21:08:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:33,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787998297] [2025-04-13 21:08:33,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:33,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:08:33,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:08:33,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:33,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:33,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787998297] [2025-04-13 21:08:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787998297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:08:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189894872] [2025-04-13 21:08:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:33,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:33,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:33,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:33,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-04-13 21:08:33,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 21:08:33,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:33,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-04-13 21:08:33,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:34,666 INFO L116 PetriNetUnfolderBase]: 12800/17186 cut-off events. [2025-04-13 21:08:34,667 INFO L117 PetriNetUnfolderBase]: For 2422/2422 co-relation queries the response was YES. [2025-04-13 21:08:34,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37982 conditions, 17186 events. 12800/17186 cut-off events. For 2422/2422 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 94663 event pairs, 6105 based on Foata normal form. 0/15998 useless extension candidates. Maximal degree in co-relation 37967. Up to 16336 conditions per place. [2025-04-13 21:08:34,775 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 35 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2025-04-13 21:08:34,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 239 flow [2025-04-13 21:08:34,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:08:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:08:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-04-13 21:08:34,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2716049382716049 [2025-04-13 21:08:34,777 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 129 flow. Second operand 6 states and 88 transitions. [2025-04-13 21:08:34,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 239 flow [2025-04-13 21:08:34,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 231 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:34,797 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 143 flow [2025-04-13 21:08:34,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2025-04-13 21:08:34,798 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2025-04-13 21:08:34,798 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 143 flow [2025-04-13 21:08:34,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 21:08:34,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:34,798 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:34,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 21:08:34,798 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:08:34,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:34,798 INFO L85 PathProgramCache]: Analyzing trace with hash 128024980, now seen corresponding path program 1 times [2025-04-13 21:08:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:34,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911737613] [2025-04-13 21:08:34,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:34,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:34,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:08:34,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:08:34,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:34,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:34,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:34,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:08:34,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:08:34,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:34,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:34,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:34,814 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 21:08:34,815 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 21:08:34,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 21:08:34,815 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:34,815 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:08:34,815 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 21:08:34,848 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:08:34,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 63 transitions, 234 flow [2025-04-13 21:08:34,854 INFO L116 PetriNetUnfolderBase]: 7/83 cut-off events. [2025-04-13 21:08:34,854 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 21:08:34,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 83 events. 7/83 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 269 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 124. Up to 14 conditions per place. [2025-04-13 21:08:34,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 63 transitions, 234 flow [2025-04-13 21:08:34,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 36 transitions, 129 flow [2025-04-13 21:08:34,856 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:34,857 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;@3ad2fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:34,857 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 21:08:34,858 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:34,858 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-13 21:08:34,858 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:08:34,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:34,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:34,858 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 21:08:34,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -379304247, now seen corresponding path program 1 times [2025-04-13 21:08:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:34,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244923146] [2025-04-13 21:08:34,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:34,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:34,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:34,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:34,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:34,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244923146] [2025-04-13 21:08:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244923146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:34,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:34,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108159438] [2025-04-13 21:08:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:34,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:34,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:34,881 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-04-13 21:08:34,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:08:34,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:34,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-04-13 21:08:34,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:37,322 INFO L116 PetriNetUnfolderBase]: 39730/53059 cut-off events. [2025-04-13 21:08:37,322 INFO L117 PetriNetUnfolderBase]: For 10356/10356 co-relation queries the response was YES. [2025-04-13 21:08:37,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107181 conditions, 53059 events. 39730/53059 cut-off events. For 10356/10356 co-relation queries the response was YES. Maximal size of possible extension queue 2332. Compared 328702 event pairs, 37546 based on Foata normal form. 0/49655 useless extension candidates. Maximal degree in co-relation 32865. Up to 49560 conditions per place. [2025-04-13 21:08:37,548 INFO L140 encePairwiseOnDemand]: 61/63 looper letters, 26 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2025-04-13 21:08:37,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 35 transitions, 181 flow [2025-04-13 21:08:37,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-13 21:08:37,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.291005291005291 [2025-04-13 21:08:37,549 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 129 flow. Second operand 3 states and 55 transitions. [2025-04-13 21:08:37,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 35 transitions, 181 flow [2025-04-13 21:08:37,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 35 transitions, 160 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:37,609 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 108 flow [2025-04-13 21:08:37,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2025-04-13 21:08:37,610 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2025-04-13 21:08:37,610 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 108 flow [2025-04-13 21:08:37,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:08:37,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:37,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:37,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 21:08:37,610 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 21:08:37,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 537905381, now seen corresponding path program 1 times [2025-04-13 21:08:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:37,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694924926] [2025-04-13 21:08:37,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:37,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:37,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:37,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:37,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:37,641 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 21:08:37,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:37,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694924926] [2025-04-13 21:08:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694924926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:37,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:37,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:08:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103871482] [2025-04-13 21:08:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:37,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:37,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:37,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:37,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-04-13 21:08:37,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 21:08:37,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:37,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-04-13 21:08:37,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:39,884 INFO L116 PetriNetUnfolderBase]: 39704/52955 cut-off events. [2025-04-13 21:08:39,884 INFO L117 PetriNetUnfolderBase]: For 4484/4484 co-relation queries the response was YES. [2025-04-13 21:08:40,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105747 conditions, 52955 events. 39704/52955 cut-off events. For 4484/4484 co-relation queries the response was YES. Maximal size of possible extension queue 2258. Compared 325626 event pairs, 34257 based on Foata normal form. 0/49549 useless extension candidates. Maximal degree in co-relation 105735. Up to 49509 conditions per place. [2025-04-13 21:08:40,335 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 27 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-04-13 21:08:40,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 38 transitions, 174 flow [2025-04-13 21:08:40,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-13 21:08:40,336 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26587301587301587 [2025-04-13 21:08:40,336 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 108 flow. Second operand 4 states and 67 transitions. [2025-04-13 21:08:40,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 38 transitions, 174 flow [2025-04-13 21:08:40,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 38 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:40,341 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 121 flow [2025-04-13 21:08:40,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2025-04-13 21:08:40,341 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-04-13 21:08:40,341 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 121 flow [2025-04-13 21:08:40,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 21:08:40,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:40,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:40,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 21:08:40,341 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 21:08:40,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1508985730, now seen corresponding path program 1 times [2025-04-13 21:08:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:40,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071970991] [2025-04-13 21:08:40,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:40,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:40,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:40,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:40,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:40,377 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 21:08:40,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:40,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071970991] [2025-04-13 21:08:40,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071970991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:40,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:40,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:40,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904304526] [2025-04-13 21:08:40,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:40,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:40,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:40,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:40,380 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-04-13 21:08:40,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 21:08:40,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:40,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-04-13 21:08:40,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:43,135 INFO L116 PetriNetUnfolderBase]: 48809/64185 cut-off events. [2025-04-13 21:08:43,136 INFO L117 PetriNetUnfolderBase]: For 5207/5207 co-relation queries the response was YES. [2025-04-13 21:08:43,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130447 conditions, 64185 events. 48809/64185 cut-off events. For 5207/5207 co-relation queries the response was YES. Maximal size of possible extension queue 2590. Compared 389750 event pairs, 37526 based on Foata normal form. 0/60731 useless extension candidates. Maximal degree in co-relation 130433. Up to 49513 conditions per place. [2025-04-13 21:08:43,495 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-04-13 21:08:43,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 233 flow [2025-04-13 21:08:43,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-13 21:08:43,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-04-13 21:08:43,496 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 121 flow. Second operand 4 states and 78 transitions. [2025-04-13 21:08:43,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 233 flow [2025-04-13 21:08:43,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:43,502 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 131 flow [2025-04-13 21:08:43,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2025-04-13 21:08:43,502 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-04-13 21:08:43,502 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 131 flow [2025-04-13 21:08:43,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 21:08:43,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:43,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:43,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 21:08:43,503 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 21:08:43,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -466082238, now seen corresponding path program 1 times [2025-04-13 21:08:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:43,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378709089] [2025-04-13 21:08:43,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:43,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:43,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:43,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:43,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:43,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378709089] [2025-04-13 21:08:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378709089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:43,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:43,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:43,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426786467] [2025-04-13 21:08:43,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:43,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:08:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:43,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:08:43,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:08:43,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-04-13 21:08:43,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 21:08:43,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:43,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-04-13 21:08:43,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:46,553 INFO L116 PetriNetUnfolderBase]: 48656/64347 cut-off events. [2025-04-13 21:08:46,553 INFO L117 PetriNetUnfolderBase]: For 13524/13524 co-relation queries the response was YES. [2025-04-13 21:08:46,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141146 conditions, 64347 events. 48656/64347 cut-off events. For 13524/13524 co-relation queries the response was YES. Maximal size of possible extension queue 2602. Compared 392896 event pairs, 30639 based on Foata normal form. 0/60765 useless extension candidates. Maximal degree in co-relation 141131. Up to 60538 conditions per place. [2025-04-13 21:08:46,922 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-04-13 21:08:46,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 44 transitions, 219 flow [2025-04-13 21:08:46,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:08:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:08:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-13 21:08:46,923 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2571428571428571 [2025-04-13 21:08:46,923 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 131 flow. Second operand 5 states and 81 transitions. [2025-04-13 21:08:46,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 44 transitions, 219 flow [2025-04-13 21:08:47,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 44 transitions, 213 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:47,205 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 143 flow [2025-04-13 21:08:47,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-04-13 21:08:47,205 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-04-13 21:08:47,205 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 143 flow [2025-04-13 21:08:47,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 21:08:47,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:47,206 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:47,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 21:08:47,206 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 21:08:47,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1882481884, now seen corresponding path program 1 times [2025-04-13 21:08:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:47,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907777919] [2025-04-13 21:08:47,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:47,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:08:47,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:08:47,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:47,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:47,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907777919] [2025-04-13 21:08:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907777919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:08:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449951548] [2025-04-13 21:08:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:47,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:47,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:47,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:47,256 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-04-13 21:08:47,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 21:08:47,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:47,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-04-13 21:08:47,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:49,992 INFO L116 PetriNetUnfolderBase]: 48035/62519 cut-off events. [2025-04-13 21:08:49,992 INFO L117 PetriNetUnfolderBase]: For 9742/9742 co-relation queries the response was YES. [2025-04-13 21:08:50,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136047 conditions, 62519 events. 48035/62519 cut-off events. For 9742/9742 co-relation queries the response was YES. Maximal size of possible extension queue 2524. Compared 367523 event pairs, 26526 based on Foata normal form. 0/58595 useless extension candidates. Maximal degree in co-relation 136031. Up to 59590 conditions per place. [2025-04-13 21:08:50,318 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 38 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-04-13 21:08:50,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 51 transitions, 259 flow [2025-04-13 21:08:50,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:08:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:08:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-13 21:08:50,319 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2566137566137566 [2025-04-13 21:08:50,319 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 143 flow. Second operand 6 states and 97 transitions. [2025-04-13 21:08:50,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 51 transitions, 259 flow [2025-04-13 21:08:50,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 251 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:50,460 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 157 flow [2025-04-13 21:08:50,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2025-04-13 21:08:50,460 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2025-04-13 21:08:50,460 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 157 flow [2025-04-13 21:08:50,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 21:08:50,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:50,460 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:50,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 21:08:50,461 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 21:08:50,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1509279707, now seen corresponding path program 1 times [2025-04-13 21:08:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:50,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433413531] [2025-04-13 21:08:50,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:50,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:08:50,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:08:50,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:50,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:50,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433413531] [2025-04-13 21:08:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433413531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:08:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842458602] [2025-04-13 21:08:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:50,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:08:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:50,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:08:50,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:08:50,518 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-04-13 21:08:50,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 157 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 21:08:50,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:50,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-04-13 21:08:50,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:53,372 INFO L116 PetriNetUnfolderBase]: 45686/58676 cut-off events. [2025-04-13 21:08:53,372 INFO L117 PetriNetUnfolderBase]: For 10994/10994 co-relation queries the response was YES. [2025-04-13 21:08:53,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130390 conditions, 58676 events. 45686/58676 cut-off events. For 10994/10994 co-relation queries the response was YES. Maximal size of possible extension queue 2456. Compared 330373 event pairs, 14781 based on Foata normal form. 0/55112 useless extension candidates. Maximal degree in co-relation 130373. Up to 56188 conditions per place. [2025-04-13 21:08:53,638 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 46 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-04-13 21:08:53,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 309 flow [2025-04-13 21:08:53,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-04-13 21:08:53,639 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26077097505668934 [2025-04-13 21:08:53,640 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 157 flow. Second operand 7 states and 115 transitions. [2025-04-13 21:08:53,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 309 flow [2025-04-13 21:08:53,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 297 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 21:08:53,770 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 171 flow [2025-04-13 21:08:53,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-04-13 21:08:53,771 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-04-13 21:08:53,771 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 171 flow [2025-04-13 21:08:53,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 21:08:53,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:53,771 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:53,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 21:08:53,771 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 21:08:53,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:53,772 INFO L85 PathProgramCache]: Analyzing trace with hash 437698885, now seen corresponding path program 1 times [2025-04-13 21:08:53,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:53,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288904444] [2025-04-13 21:08:53,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:53,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:08:53,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:08:53,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:53,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:53,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:08:53,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:08:53,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:08:53,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:53,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:08:53,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:08:53,786 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 21:08:53,786 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 21:08:53,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 21:08:53,787 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:53,787 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:08:53,787 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-13 21:08:53,816 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:08:53,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 72 transitions, 284 flow [2025-04-13 21:08:53,821 INFO L116 PetriNetUnfolderBase]: 8/95 cut-off events. [2025-04-13 21:08:53,821 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-13 21:08:53,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 95 events. 8/95 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 333 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 146. Up to 16 conditions per place. [2025-04-13 21:08:53,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 72 transitions, 284 flow [2025-04-13 21:08:53,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 40 transitions, 153 flow [2025-04-13 21:08:53,822 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:53,822 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;@3ad2fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:53,822 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-13 21:08:53,823 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:53,823 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-13 21:08:53,823 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:08:53,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:53,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:53,823 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 21:08:53,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1750711664, now seen corresponding path program 1 times [2025-04-13 21:08:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:53,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112917332] [2025-04-13 21:08:53,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:53,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:53,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:53,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:53,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:53,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:53,834 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 21:08:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:53,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112917332] [2025-04-13 21:08:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112917332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:53,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:53,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363401601] [2025-04-13 21:08:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:53,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:53,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:53,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:53,836 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-04-13 21:08:53,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 21:08:53,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:53,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-04-13 21:08:53,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:01,316 INFO L116 PetriNetUnfolderBase]: 138874/178931 cut-off events. [2025-04-13 21:09:01,316 INFO L117 PetriNetUnfolderBase]: For 42183/42183 co-relation queries the response was YES. [2025-04-13 21:09:01,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362087 conditions, 178931 events. 138874/178931 cut-off events. For 42183/42183 co-relation queries the response was YES. Maximal size of possible extension queue 6709. Compared 1135557 event pairs, 132316 based on Foata normal form. 0/168723 useless extension candidates. Maximal degree in co-relation 112810. Up to 168387 conditions per place. [2025-04-13 21:09:02,326 INFO L140 encePairwiseOnDemand]: 70/72 looper letters, 29 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2025-04-13 21:09:02,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 39 transitions, 211 flow [2025-04-13 21:09:02,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:09:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:09:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-13 21:09:02,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2824074074074074 [2025-04-13 21:09:02,327 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 153 flow. Second operand 3 states and 61 transitions. [2025-04-13 21:09:02,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 39 transitions, 211 flow [2025-04-13 21:09:02,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 39 transitions, 180 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-13 21:09:02,849 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 122 flow [2025-04-13 21:09:02,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2025-04-13 21:09:02,850 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 1 predicate places. [2025-04-13 21:09:02,850 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 122 flow [2025-04-13 21:09:02,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 21:09:02,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:02,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:02,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 21:09:02,850 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 21:09:02,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1215609708, now seen corresponding path program 1 times [2025-04-13 21:09:02,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:02,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781024727] [2025-04-13 21:09:02,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:02,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:09:02,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:09:02,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:02,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:02,871 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 21:09:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:02,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781024727] [2025-04-13 21:09:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781024727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:09:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830373895] [2025-04-13 21:09:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:02,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:09:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:02,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:09:02,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:09:02,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-04-13 21:09:02,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 21:09:02,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:02,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-04-13 21:09:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:10,685 INFO L116 PetriNetUnfolderBase]: 138848/178836 cut-off events. [2025-04-13 21:09:10,685 INFO L117 PetriNetUnfolderBase]: For 17855/17855 co-relation queries the response was YES. [2025-04-13 21:09:11,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357017 conditions, 178836 events. 138848/178836 cut-off events. For 17855/17855 co-relation queries the response was YES. Maximal size of possible extension queue 6609. Compared 1131353 event pairs, 122466 based on Foata normal form. 0/168624 useless extension candidates. Maximal degree in co-relation 357004. Up to 168336 conditions per place. [2025-04-13 21:09:11,576 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 30 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-04-13 21:09:11,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 42 transitions, 194 flow [2025-04-13 21:09:11,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:09:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:09:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-04-13 21:09:11,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2569444444444444 [2025-04-13 21:09:11,577 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 122 flow. Second operand 4 states and 74 transitions. [2025-04-13 21:09:11,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 42 transitions, 194 flow [2025-04-13 21:09:11,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 42 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:09:11,605 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 135 flow [2025-04-13 21:09:11,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-04-13 21:09:11,605 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2025-04-13 21:09:11,605 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 135 flow [2025-04-13 21:09:11,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 21:09:11,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:11,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:11,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 21:09:11,606 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 21:09:11,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash 8759865, now seen corresponding path program 1 times [2025-04-13 21:09:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:11,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194201105] [2025-04-13 21:09:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:11,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:09:11,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:09:11,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:11,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:11,643 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 21:09:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:11,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194201105] [2025-04-13 21:09:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194201105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:11,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:11,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:09:11,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594188551] [2025-04-13 21:09:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:11,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:09:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:11,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:09:11,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:09:11,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-04-13 21:09:11,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 21:09:11,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:11,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-04-13 21:09:11,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:21,083 INFO L116 PetriNetUnfolderBase]: 170552/217032 cut-off events. [2025-04-13 21:09:21,083 INFO L117 PetriNetUnfolderBase]: For 20030/20030 co-relation queries the response was YES. [2025-04-13 21:09:21,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440030 conditions, 217032 events. 170552/217032 cut-off events. For 20030/20030 co-relation queries the response was YES. Maximal size of possible extension queue 7531. Compared 1353819 event pairs, 132296 based on Foata normal form. 0/206774 useless extension candidates. Maximal degree in co-relation 440015. Up to 168340 conditions per place. [2025-04-13 21:09:22,249 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 44 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-04-13 21:09:22,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 261 flow [2025-04-13 21:09:22,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:09:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:09:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-13 21:09:22,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3020833333333333 [2025-04-13 21:09:22,250 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 135 flow. Second operand 4 states and 87 transitions. [2025-04-13 21:09:22,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 261 flow [2025-04-13 21:09:22,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:09:22,281 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 145 flow [2025-04-13 21:09:22,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2025-04-13 21:09:22,281 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2025-04-13 21:09:22,281 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 145 flow [2025-04-13 21:09:22,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 21:09:22,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:22,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:22,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 21:09:22,281 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 21:09:22,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash 271556286, now seen corresponding path program 1 times [2025-04-13 21:09:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:22,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304042725] [2025-04-13 21:09:22,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:22,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:22,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:09:22,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:09:22,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:22,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:09:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:22,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304042725] [2025-04-13 21:09:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304042725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:09:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874522493] [2025-04-13 21:09:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:22,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:09:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:22,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:09:22,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:09:22,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-04-13 21:09:22,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 21:09:22,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:22,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-04-13 21:09:22,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:31,867 INFO L116 PetriNetUnfolderBase]: 170399/218634 cut-off events. [2025-04-13 21:09:31,867 INFO L117 PetriNetUnfolderBase]: For 45813/45813 co-relation queries the response was YES. [2025-04-13 21:09:32,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474039 conditions, 218634 events. 170399/218634 cut-off events. For 45813/45813 co-relation queries the response was YES. Maximal size of possible extension queue 7650. Compared 1384716 event pairs, 127908 based on Foata normal form. 0/208248 useless extension candidates. Maximal degree in co-relation 474023. Up to 206338 conditions per place. [2025-04-13 21:09:33,276 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 35 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-04-13 21:09:33,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 239 flow [2025-04-13 21:09:33,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:09:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:09:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-04-13 21:09:33,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24722222222222223 [2025-04-13 21:09:33,277 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 145 flow. Second operand 5 states and 89 transitions. [2025-04-13 21:09:33,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 239 flow [2025-04-13 21:09:36,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 48 transitions, 233 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:09:36,543 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 157 flow [2025-04-13 21:09:36,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2025-04-13 21:09:36,544 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2025-04-13 21:09:36,544 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 157 flow [2025-04-13 21:09:36,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 21:09:36,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:36,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:36,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 21:09:36,545 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 21:09:36,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1663110248, now seen corresponding path program 1 times [2025-04-13 21:09:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:36,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522051644] [2025-04-13 21:09:36,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:36,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:09:36,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:09:36,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:36,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:09:36,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:36,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522051644] [2025-04-13 21:09:36,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522051644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:36,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:09:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811956430] [2025-04-13 21:09:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:36,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:09:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:36,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:09:36,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:09:36,589 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-04-13 21:09:36,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 21:09:36,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:36,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-04-13 21:09:36,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:45,960 INFO L116 PetriNetUnfolderBase]: 169778/217524 cut-off events. [2025-04-13 21:09:45,960 INFO L117 PetriNetUnfolderBase]: For 34605/34605 co-relation queries the response was YES. [2025-04-13 21:09:46,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465284 conditions, 217524 events. 169778/217524 cut-off events. For 34605/34605 co-relation queries the response was YES. Maximal size of possible extension queue 7610. Compared 1371812 event pairs, 91917 based on Foata normal form. 0/207264 useless extension candidates. Maximal degree in co-relation 465267. Up to 205390 conditions per place. [2025-04-13 21:09:47,347 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 41 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-04-13 21:09:47,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 279 flow [2025-04-13 21:09:47,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:09:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:09:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2025-04-13 21:09:47,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24537037037037038 [2025-04-13 21:09:47,348 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 157 flow. Second operand 6 states and 106 transitions. [2025-04-13 21:09:47,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 279 flow [2025-04-13 21:09:48,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 55 transitions, 271 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-13 21:09:48,896 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 171 flow [2025-04-13 21:09:48,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2025-04-13 21:09:48,896 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-04-13 21:09:48,897 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 171 flow [2025-04-13 21:09:48,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 21:09:48,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:48,897 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:48,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 21:09:48,897 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 21:09:48,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1128181103, now seen corresponding path program 1 times [2025-04-13 21:09:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:48,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177783657] [2025-04-13 21:09:48,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:09:48,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:09:48,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:48,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:09:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:48,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177783657] [2025-04-13 21:09:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177783657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:09:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182344729] [2025-04-13 21:09:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:48,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:09:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:48,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:09:48,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:09:48,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-04-13 21:09:48,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 21:09:48,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:48,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-04-13 21:09:48,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:58,349 INFO L116 PetriNetUnfolderBase]: 167429/212991 cut-off events. [2025-04-13 21:09:58,349 INFO L117 PetriNetUnfolderBase]: For 41930/41930 co-relation queries the response was YES. [2025-04-13 21:09:58,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463311 conditions, 212991 events. 167429/212991 cut-off events. For 41930/41930 co-relation queries the response was YES. Maximal size of possible extension queue 7454. Compared 1311776 event pairs, 79545 based on Foata normal form. 0/202623 useless extension candidates. Maximal degree in co-relation 463293. Up to 201988 conditions per place. [2025-04-13 21:09:59,644 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 49 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-04-13 21:09:59,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 64 transitions, 329 flow [2025-04-13 21:09:59,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:09:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:09:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-04-13 21:09:59,645 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24801587301587302 [2025-04-13 21:09:59,645 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 171 flow. Second operand 7 states and 125 transitions. [2025-04-13 21:09:59,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 64 transitions, 329 flow [2025-04-13 21:10:01,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 317 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 21:10:01,244 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 185 flow [2025-04-13 21:10:01,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2025-04-13 21:10:01,245 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2025-04-13 21:10:01,245 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 185 flow [2025-04-13 21:10:01,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 21:10:01,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:10:01,245 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:10:01,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 21:10:01,245 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 21:10:01,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:10:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1866248169, now seen corresponding path program 1 times [2025-04-13 21:10:01,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:10:01,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981530636] [2025-04-13 21:10:01,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:10:01,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:10:01,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:10:01,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:10:01,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:10:01,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:10:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:10:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:10:01,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981530636] [2025-04-13 21:10:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981530636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:10:01,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:10:01,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:10:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800845861] [2025-04-13 21:10:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:10:01,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:10:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:10:01,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:10:01,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:10:01,312 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-04-13 21:10:01,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 44 transitions, 185 flow. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 21:10:01,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:10:01,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-04-13 21:10:01,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand