/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-theta/unwind3-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:47:22,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:47:22,264 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-14 01:47:22,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:47:22,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:47:22,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:47:22,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:47:22,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:47:22,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:47:22,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:47:22,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:47:22,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:47:22,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:47:22,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:47:22,294 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:47:22,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:47:22,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:47:22,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:22,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:22,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:47:22,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:47:22,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:47:22,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:47:22,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:47:22,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:47:22,297 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:47:22,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:47:22,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:47:22,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:47:22,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:47:22,538 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:47:22,539 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-14 01:47:23,755 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668160fe2/6238098cee594779a504e7087e78a364/FLAG31ea9a68a [2025-04-14 01:47:23,982 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:47:23,982 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind3-100.i [2025-04-14 01:47:23,991 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668160fe2/6238098cee594779a504e7087e78a364/FLAG31ea9a68a [2025-04-14 01:47:24,956 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668160fe2/6238098cee594779a504e7087e78a364 [2025-04-14 01:47:24,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:47:24,959 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:47:24,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:47:24,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:47:24,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:47:24,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:47:24" (1/1) ... [2025-04-14 01:47:24,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f79748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:24, skipping insertion in model container [2025-04-14 01:47:24,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:47:24" (1/1) ... [2025-04-14 01:47:24,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:47:25,288 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-14 01:47:25,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:47:25,312 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:47:25,371 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-14 01:47:25,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:47:25,407 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:47:25,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25 WrapperNode [2025-04-14 01:47:25,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:47:25,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:47:25,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:47:25,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:47:25,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,448 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-14 01:47:25,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:47:25,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:47:25,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:47:25,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:47:25,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,469 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-14 01:47:25,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:47:25,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:47:25,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:47:25,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:47:25,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (1/1) ... [2025-04-14 01:47:25,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:25,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:25,510 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-14 01:47:25,512 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-14 01:47:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:47:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 01:47:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 01:47:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 01:47:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 01:47:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:47:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:47:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:47:25,529 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:47:25,623 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:47:25,624 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:47:25,714 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:47:25,715 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:47:25,715 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:47:25,786 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:47:25,791 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:47:25,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:47:25 BoogieIcfgContainer [2025-04-14 01:47:25,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:47:25,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:47:25,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:47:25,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:47:25,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:47:24" (1/3) ... [2025-04-14 01:47:25,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66987c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:47:25, skipping insertion in model container [2025-04-14 01:47:25,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:25" (2/3) ... [2025-04-14 01:47:25,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66987c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:47:25, skipping insertion in model container [2025-04-14 01:47:25,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:47:25" (3/3) ... [2025-04-14 01:47:25,799 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-04-14 01:47:25,808 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:47:25,809 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-14 01:47:25,809 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:47:25,841 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:47:25,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 44 flow [2025-04-14 01:47:25,883 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-14 01:47:25,885 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:47:25,886 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 49 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-14 01:47:25,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 18 transitions, 44 flow [2025-04-14 01:47:25,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 39 flow [2025-04-14 01:47:25,892 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:25,900 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;@3fa0f96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:25,901 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:47:25,908 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:25,908 INFO L116 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-04-14 01:47:25,908 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:47:25,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:25,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:25,909 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:47:25,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash 828891615, now seen corresponding path program 1 times [2025-04-14 01:47:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:25,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287099099] [2025-04-14 01:47:25,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:25,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:25,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:25,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:25,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:25,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:26,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:26,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:26,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:26,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:26,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:26,031 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:26,032 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-14 01:47:26,034 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:47:26,034 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-14 01:47:26,034 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-14 01:47:26,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:47:26,035 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 01:47:26,038 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:47:26,039 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 01:47:26,058 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:47:26,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 74 flow [2025-04-14 01:47:26,075 INFO L116 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-04-14 01:47:26,075 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:47:26,075 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 6. Compared 86 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-14 01:47:26,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 27 transitions, 74 flow [2025-04-14 01:47:26,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 20 transitions, 53 flow [2025-04-14 01:47:26,076 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:26,080 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;@3fa0f96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:26,080 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 01:47:26,111 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:26,111 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-14 01:47:26,111 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:47:26,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:26,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:26,111 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 01:47:26,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1627684701, now seen corresponding path program 1 times [2025-04-14 01:47:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:26,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897352628] [2025-04-14 01:47:26,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:26,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:26,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:26,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:26,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:26,219 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-14 01:47:26,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:26,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897352628] [2025-04-14 01:47:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897352628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:26,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:26,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:47:26,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027636778] [2025-04-14 01:47:26,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:26,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:47:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:26,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:47:26,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:47:26,244 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:47:26,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:26,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:26,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:47:26,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:26,350 INFO L116 PetriNetUnfolderBase]: 308/493 cut-off events. [2025-04-14 01:47:26,351 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-14 01:47:26,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 493 events. 308/493 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1687 event pairs, 268 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 618. Up to 491 conditions per place. [2025-04-14 01:47:26,360 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 17 selfloop transitions, 1 changer transitions 0/19 dead transitions. [2025-04-14 01:47:26,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 87 flow [2025-04-14 01:47:26,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:47:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:47:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2025-04-14 01:47:26,370 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30864197530864196 [2025-04-14 01:47:26,371 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 53 flow. Second operand 3 states and 25 transitions. [2025-04-14 01:47:26,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 87 flow [2025-04-14 01:47:26,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:26,375 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 52 flow [2025-04-14 01:47:26,377 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-14 01:47:26,379 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2025-04-14 01:47:26,379 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 52 flow [2025-04-14 01:47:26,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:26,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:26,379 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:26,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:47:26,379 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 01:47:26,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash 805158147, now seen corresponding path program 1 times [2025-04-14 01:47:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:26,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987070380] [2025-04-14 01:47:26,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:26,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:26,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:26,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:26,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:26,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:26,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:26,406 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:26,406 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-14 01:47:26,406 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-14 01:47:26,406 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-14 01:47:26,406 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-14 01:47:26,406 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-14 01:47:26,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:47:26,407 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-14 01:47:26,407 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:47:26,407 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 01:47:26,432 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:47:26,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 108 flow [2025-04-14 01:47:26,443 INFO L116 PetriNetUnfolderBase]: 4/47 cut-off events. [2025-04-14 01:47:26,443 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-14 01:47:26,443 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 6. Compared 138 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-14 01:47:26,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 36 transitions, 108 flow [2025-04-14 01:47:26,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 24 transitions, 69 flow [2025-04-14 01:47:26,444 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:26,444 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;@3fa0f96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:26,444 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 01:47:26,450 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:26,450 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-14 01:47:26,450 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:47:26,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:26,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:26,451 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:26,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1602270139, now seen corresponding path program 1 times [2025-04-14 01:47:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:26,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072562934] [2025-04-14 01:47:26,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:26,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:26,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:26,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:26,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:26,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:26,493 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-14 01:47:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:26,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072562934] [2025-04-14 01:47:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072562934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:47:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446143802] [2025-04-14 01:47:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:26,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:47:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:26,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:47:26,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:47:26,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-04-14 01:47:26,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:26,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:26,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-04-14 01:47:26,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:26,685 INFO L116 PetriNetUnfolderBase]: 1812/2579 cut-off events. [2025-04-14 01:47:26,685 INFO L117 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-04-14 01:47:26,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5402 conditions, 2579 events. 1812/2579 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10389 event pairs, 1644 based on Foata normal form. 0/2327 useless extension candidates. Maximal degree in co-relation 1496. Up to 2571 conditions per place. [2025-04-14 01:47:26,702 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 21 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2025-04-14 01:47:26,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 111 flow [2025-04-14 01:47:26,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:47:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:47:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-14 01:47:26,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26851851851851855 [2025-04-14 01:47:26,703 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 29 transitions. [2025-04-14 01:47:26,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 111 flow [2025-04-14 01:47:26,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:26,705 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 66 flow [2025-04-14 01:47:26,705 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-14 01:47:26,705 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-04-14 01:47:26,707 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 66 flow [2025-04-14 01:47:26,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:26,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:26,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:26,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:47:26,707 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:26,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2078691393, now seen corresponding path program 1 times [2025-04-14 01:47:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:26,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995785753] [2025-04-14 01:47:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:26,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:26,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:26,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:26,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:26,775 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-14 01:47:26,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:26,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995785753] [2025-04-14 01:47:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995785753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:26,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:26,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:47:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360424457] [2025-04-14 01:47:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:26,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:47:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:26,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:47:26,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:47:26,776 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-04-14 01:47:26,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:47:26,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:26,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-04-14 01:47:26,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:26,971 INFO L116 PetriNetUnfolderBase]: 1775/2514 cut-off events. [2025-04-14 01:47:26,971 INFO L117 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-04-14 01:47:26,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5249 conditions, 2514 events. 1775/2514 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10010 event pairs, 1072 based on Foata normal form. 0/2274 useless extension candidates. Maximal degree in co-relation 5240. Up to 2501 conditions per place. [2025-04-14 01:47:26,982 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 23 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-04-14 01:47:26,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 126 flow [2025-04-14 01:47:26,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:47:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:47:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-14 01:47:26,984 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24305555555555555 [2025-04-14 01:47:26,984 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 66 flow. Second operand 4 states and 35 transitions. [2025-04-14 01:47:26,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 126 flow [2025-04-14 01:47:26,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 125 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:26,987 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 79 flow [2025-04-14 01:47:26,987 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-14 01:47:26,988 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2025-04-14 01:47:26,988 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 79 flow [2025-04-14 01:47:26,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:47:26,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:26,989 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:26,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:47:26,989 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-14 01:47:26,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash 430562838, now seen corresponding path program 1 times [2025-04-14 01:47:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:26,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732649717] [2025-04-14 01:47:26,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:27,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:27,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:27,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:27,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:27,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:27,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:27,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:27,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:27,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:27,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:27,018 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:27,018 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-14 01:47:27,018 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-14 01:47:27,018 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-14 01:47:27,018 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-14 01:47:27,018 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-14 01:47:27,018 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 01:47:27,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:47:27,018 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-14 01:47:27,019 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:47:27,019 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-14 01:47:27,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:47:27,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 146 flow [2025-04-14 01:47:27,057 INFO L116 PetriNetUnfolderBase]: 5/59 cut-off events. [2025-04-14 01:47:27,057 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-14 01:47:27,057 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 6. Compared 180 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-14 01:47:27,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 146 flow [2025-04-14 01:47:27,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 28 transitions, 87 flow [2025-04-14 01:47:27,058 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:27,058 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;@3fa0f96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:27,059 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 01:47:27,060 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:27,060 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-14 01:47:27,060 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:47:27,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:27,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:27,060 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-14 01:47:27,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -271006707, now seen corresponding path program 1 times [2025-04-14 01:47:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:27,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109200086] [2025-04-14 01:47:27,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:27,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:27,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:27,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:27,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109200086] [2025-04-14 01:47:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109200086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:47:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827216396] [2025-04-14 01:47:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:27,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:47:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:27,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:47:27,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:47:27,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2025-04-14 01:47:27,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:27,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:27,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2025-04-14 01:47:27,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:27,752 INFO L116 PetriNetUnfolderBase]: 9556/12651 cut-off events. [2025-04-14 01:47:27,752 INFO L117 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-04-14 01:47:27,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26355 conditions, 12651 events. 9556/12651 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 55746 event pairs, 8876 based on Foata normal form. 0/11631 useless extension candidates. Maximal degree in co-relation 7600. Up to 12619 conditions per place. [2025-04-14 01:47:27,809 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 25 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-14 01:47:27,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 137 flow [2025-04-14 01:47:27,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:47:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:47:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2025-04-14 01:47:27,811 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24444444444444444 [2025-04-14 01:47:27,811 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 87 flow. Second operand 3 states and 33 transitions. [2025-04-14 01:47:27,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 137 flow [2025-04-14 01:47:27,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 130 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:27,819 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 80 flow [2025-04-14 01:47:27,819 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-14 01:47:27,819 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-04-14 01:47:27,819 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 80 flow [2025-04-14 01:47:27,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:27,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:27,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:27,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:47:27,820 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-14 01:47:27,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1521465904, now seen corresponding path program 1 times [2025-04-14 01:47:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:27,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890235269] [2025-04-14 01:47:27,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:27,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:27,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:27,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:27,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:27,865 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-14 01:47:27,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:27,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890235269] [2025-04-14 01:47:27,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890235269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:27,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:27,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:47:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899509300] [2025-04-14 01:47:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:27,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:47:27,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:27,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:47:27,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:47:27,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2025-04-14 01:47:27,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:47:27,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:27,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2025-04-14 01:47:27,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:28,369 INFO L116 PetriNetUnfolderBase]: 9519/12586 cut-off events. [2025-04-14 01:47:28,369 INFO L117 PetriNetUnfolderBase]: For 412/412 co-relation queries the response was YES. [2025-04-14 01:47:28,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26074 conditions, 12586 events. 9519/12586 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 55100 event pairs, 6576 based on Foata normal form. 0/11578 useless extension candidates. Maximal degree in co-relation 26064. Up to 12549 conditions per place. [2025-04-14 01:47:28,404 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-04-14 01:47:28,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 148 flow [2025-04-14 01:47:28,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:47:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:47:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-14 01:47:28,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2025-04-14 01:47:28,406 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 80 flow. Second operand 4 states and 39 transitions. [2025-04-14 01:47:28,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 148 flow [2025-04-14 01:47:28,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 147 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:28,409 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 93 flow [2025-04-14 01:47:28,409 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-14 01:47:28,409 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2025-04-14 01:47:28,409 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 93 flow [2025-04-14 01:47:28,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:47:28,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:28,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:28,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:47:28,412 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-14 01:47:28,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1806682900, now seen corresponding path program 1 times [2025-04-14 01:47:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:28,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074405013] [2025-04-14 01:47:28,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:28,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:28,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:28,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:28,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:28,522 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-14 01:47:28,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:28,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074405013] [2025-04-14 01:47:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074405013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:28,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:28,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:47:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143801541] [2025-04-14 01:47:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:28,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:47:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:28,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:47:28,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:47:28,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2025-04-14 01:47:28,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-14 01:47:28,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:28,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2025-04-14 01:47:28,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:29,335 INFO L116 PetriNetUnfolderBase]: 11727/15466 cut-off events. [2025-04-14 01:47:29,335 INFO L117 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2025-04-14 01:47:29,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32517 conditions, 15466 events. 11727/15466 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 70160 event pairs, 8847 based on Foata normal form. 0/14458 useless extension candidates. Maximal degree in co-relation 32505. Up to 12554 conditions per place. [2025-04-14 01:47:29,381 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 38 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-04-14 01:47:29,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 203 flow [2025-04-14 01:47:29,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:47:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:47:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-04-14 01:47:29,383 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2722222222222222 [2025-04-14 01:47:29,383 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 93 flow. Second operand 4 states and 49 transitions. [2025-04-14 01:47:29,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 203 flow [2025-04-14 01:47:29,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:47:29,385 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 103 flow [2025-04-14 01:47:29,385 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-14 01:47:29,387 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-04-14 01:47:29,387 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 103 flow [2025-04-14 01:47:29,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-14 01:47:29,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:29,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:29,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:47:29,387 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-14 01:47:29,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash 172595313, now seen corresponding path program 1 times [2025-04-14 01:47:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:29,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138992782] [2025-04-14 01:47:29,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:29,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:29,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:29,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:29,446 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-14 01:47:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:29,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138992782] [2025-04-14 01:47:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138992782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563515533] [2025-04-14 01:47:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:29,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:47:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:29,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:47:29,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:47:29,447 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2025-04-14 01:47:29,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-14 01:47:29,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:29,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2025-04-14 01:47:29,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:29,960 INFO L116 PetriNetUnfolderBase]: 11431/15042 cut-off events. [2025-04-14 01:47:29,960 INFO L117 PetriNetUnfolderBase]: For 2819/2819 co-relation queries the response was YES. [2025-04-14 01:47:29,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34802 conditions, 15042 events. 11431/15042 cut-off events. For 2819/2819 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 66575 event pairs, 5472 based on Foata normal form. 0/14082 useless extension candidates. Maximal degree in co-relation 34789. Up to 14954 conditions per place. [2025-04-14 01:47:30,014 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 34 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-04-14 01:47:30,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 201 flow [2025-04-14 01:47:30,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:47:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:47:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-14 01:47:30,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.21333333333333335 [2025-04-14 01:47:30,015 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 103 flow. Second operand 5 states and 48 transitions. [2025-04-14 01:47:30,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 201 flow [2025-04-14 01:47:30,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 195 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:47:30,037 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 115 flow [2025-04-14 01:47:30,037 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-14 01:47:30,037 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-04-14 01:47:30,037 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 115 flow [2025-04-14 01:47:30,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-14 01:47:30,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:30,037 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:30,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:47:30,038 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-14 01:47:30,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1023199992, now seen corresponding path program 1 times [2025-04-14 01:47:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:30,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228319000] [2025-04-14 01:47:30,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:30,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 01:47:30,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:47:30,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:30,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:30,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 01:47:30,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:47:30,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:30,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:30,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:30,058 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:30,059 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-14 01:47:30,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-14 01:47:30,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-14 01:47:30,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-14 01:47:30,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-14 01:47:30,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-14 01:47:30,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-14 01:47:30,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:47:30,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-14 01:47:30,059 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:47:30,059 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-14 01:47:30,091 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:47:30,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 54 transitions, 188 flow [2025-04-14 01:47:30,098 INFO L116 PetriNetUnfolderBase]: 6/71 cut-off events. [2025-04-14 01:47:30,098 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-14 01:47:30,099 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 7. Compared 220 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-14 01:47:30,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 54 transitions, 188 flow [2025-04-14 01:47:30,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 32 transitions, 107 flow [2025-04-14 01:47:30,099 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:30,100 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;@3fa0f96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:30,100 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 01:47:30,102 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:30,102 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-14 01:47:30,102 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:47:30,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:30,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:30,102 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:47:30,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1326507445, now seen corresponding path program 1 times [2025-04-14 01:47:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:30,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679697180] [2025-04-14 01:47:30,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:30,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:30,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:30,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:30,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:30,131 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-14 01:47:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:30,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679697180] [2025-04-14 01:47:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679697180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:47:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750390078] [2025-04-14 01:47:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:30,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:47:30,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:30,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:47:30,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:47:30,132 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 54 [2025-04-14 01:47:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:30,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:30,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 54 [2025-04-14 01:47:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:32,344 INFO L116 PetriNetUnfolderBase]: 47444/59851 cut-off events. [2025-04-14 01:47:32,344 INFO L117 PetriNetUnfolderBase]: For 6861/6861 co-relation queries the response was YES. [2025-04-14 01:47:32,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124244 conditions, 59851 events. 47444/59851 cut-off events. For 6861/6861 co-relation queries the response was YES. Maximal size of possible extension queue 1523. Compared 280734 event pairs, 44716 based on Foata normal form. 0/55759 useless extension candidates. Maximal degree in co-relation 36880. Up to 59723 conditions per place. [2025-04-14 01:47:32,554 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 29 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2025-04-14 01:47:32,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 165 flow [2025-04-14 01:47:32,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:47:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:47:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:47:32,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22839506172839505 [2025-04-14 01:47:32,557 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 107 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:47:32,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 165 flow [2025-04-14 01:47:32,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 152 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:32,593 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 94 flow [2025-04-14 01:47:32,593 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-14 01:47:32,593 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-04-14 01:47:32,595 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 94 flow [2025-04-14 01:47:32,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:32,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:32,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:32,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:47:32,596 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:47:32,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -866486497, now seen corresponding path program 1 times [2025-04-14 01:47:32,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:32,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862849647] [2025-04-14 01:47:32,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:32,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:32,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:32,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:32,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:32,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:32,625 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-14 01:47:32,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:32,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862849647] [2025-04-14 01:47:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862849647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:32,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:32,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:47:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425311211] [2025-04-14 01:47:32,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:32,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:47:32,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:32,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:47:32,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:47:32,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 54 [2025-04-14 01:47:32,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:47:32,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:32,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 54 [2025-04-14 01:47:32,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:34,748 INFO L116 PetriNetUnfolderBase]: 47407/59786 cut-off events. [2025-04-14 01:47:34,748 INFO L117 PetriNetUnfolderBase]: For 2204/2204 co-relation queries the response was YES. [2025-04-14 01:47:34,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123195 conditions, 59786 events. 47407/59786 cut-off events. For 2204/2204 co-relation queries the response was YES. Maximal size of possible extension queue 1506. Compared 279314 event pairs, 35504 based on Foata normal form. 0/55706 useless extension candidates. Maximal degree in co-relation 123184. Up to 59653 conditions per place. [2025-04-14 01:47:34,965 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 31 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-04-14 01:47:34,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 170 flow [2025-04-14 01:47:34,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:47:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:47:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-14 01:47:34,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.19907407407407407 [2025-04-14 01:47:34,966 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 94 flow. Second operand 4 states and 43 transitions. [2025-04-14 01:47:34,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 170 flow [2025-04-14 01:47:34,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 35 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:34,969 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 107 flow [2025-04-14 01:47:34,969 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-14 01:47:34,970 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-04-14 01:47:34,970 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 107 flow [2025-04-14 01:47:34,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:47:34,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:34,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:34,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:47:34,970 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:47:34,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash 496201098, now seen corresponding path program 1 times [2025-04-14 01:47:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:34,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012208889] [2025-04-14 01:47:34,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:34,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:34,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:34,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:34,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:35,012 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-14 01:47:35,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:35,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012208889] [2025-04-14 01:47:35,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012208889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:35,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:35,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:47:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020380069] [2025-04-14 01:47:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:35,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:47:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:35,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:47:35,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:47:35,014 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 54 [2025-04-14 01:47:35,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-14 01:47:35,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:35,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 54 [2025-04-14 01:47:35,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:37,612 INFO L116 PetriNetUnfolderBase]: 58319/73418 cut-off events. [2025-04-14 01:47:37,612 INFO L117 PetriNetUnfolderBase]: For 3388/3388 co-relation queries the response was YES. [2025-04-14 01:47:37,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153190 conditions, 73418 events. 58319/73418 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 1736. Compared 353046 event pairs, 44687 based on Foata normal form. 0/69338 useless extension candidates. Maximal degree in co-relation 153177. Up to 59658 conditions per place. [2025-04-14 01:47:37,962 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 45 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-04-14 01:47:37,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 237 flow [2025-04-14 01:47:37,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:47:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:47:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-14 01:47:37,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2025-04-14 01:47:37,963 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 107 flow. Second operand 4 states and 56 transitions. [2025-04-14 01:47:37,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 237 flow [2025-04-14 01:47:37,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:47:37,968 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 117 flow [2025-04-14 01:47:37,968 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-14 01:47:37,968 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-04-14 01:47:37,968 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 117 flow [2025-04-14 01:47:37,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-14 01:47:37,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:37,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:37,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 01:47:37,968 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:47:37,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1797634836, now seen corresponding path program 1 times [2025-04-14 01:47:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:37,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55859998] [2025-04-14 01:47:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:37,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:37,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:37,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:37,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:38,003 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-14 01:47:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:38,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55859998] [2025-04-14 01:47:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55859998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:38,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:38,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330626886] [2025-04-14 01:47:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:38,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:47:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:47:38,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:47:38,057 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 54 [2025-04-14 01:47:38,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-14 01:47:38,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:38,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 54 [2025-04-14 01:47:38,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:40,720 INFO L116 PetriNetUnfolderBase]: 58023/72978 cut-off events. [2025-04-14 01:47:40,720 INFO L117 PetriNetUnfolderBase]: For 14723/14723 co-relation queries the response was YES. [2025-04-14 01:47:40,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165699 conditions, 72978 events. 58023/72978 cut-off events. For 14723/14723 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 343508 event pairs, 33120 based on Foata normal form. 0/68946 useless extension candidates. Maximal degree in co-relation 165685. Up to 72810 conditions per place. [2025-04-14 01:47:41,048 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 38 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2025-04-14 01:47:41,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 223 flow [2025-04-14 01:47:41,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:47:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:47:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-04-14 01:47:41,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.1925925925925926 [2025-04-14 01:47:41,050 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 117 flow. Second operand 5 states and 52 transitions. [2025-04-14 01:47:41,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 223 flow [2025-04-14 01:47:41,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 217 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:47:41,239 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 129 flow [2025-04-14 01:47:41,239 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-14 01:47:41,239 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2025-04-14 01:47:41,239 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 129 flow [2025-04-14 01:47:41,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-14 01:47:41,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:41,240 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:41,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:47:41,240 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:47:41,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:41,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1973744832, now seen corresponding path program 1 times [2025-04-14 01:47:41,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:41,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917136363] [2025-04-14 01:47:41,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:41,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:47:41,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:47:41,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:41,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:41,303 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-14 01:47:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:41,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917136363] [2025-04-14 01:47:41,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917136363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:41,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:41,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:47:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776252492] [2025-04-14 01:47:41,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:41,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:41,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:41,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:41,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:41,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 54 [2025-04-14 01:47:41,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-14 01:47:41,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:41,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 54 [2025-04-14 01:47:41,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:43,917 INFO L116 PetriNetUnfolderBase]: 56407/70786 cut-off events. [2025-04-14 01:47:43,917 INFO L117 PetriNetUnfolderBase]: For 9010/9010 co-relation queries the response was YES. [2025-04-14 01:47:44,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158025 conditions, 70786 events. 56407/70786 cut-off events. For 9010/9010 co-relation queries the response was YES. Maximal size of possible extension queue 1693. Compared 330352 event pairs, 21888 based on Foata normal form. 0/66946 useless extension candidates. Maximal degree in co-relation 158010. Up to 70418 conditions per place. [2025-04-14 01:47:44,215 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 47 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-04-14 01:47:44,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 275 flow [2025-04-14 01:47:44,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:47:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:47:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2025-04-14 01:47:44,216 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.19753086419753085 [2025-04-14 01:47:44,216 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 129 flow. Second operand 6 states and 64 transitions. [2025-04-14 01:47:44,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 275 flow [2025-04-14 01:47:44,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 267 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:44,311 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 143 flow [2025-04-14 01:47:44,311 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-14 01:47:44,311 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2025-04-14 01:47:44,311 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 143 flow [2025-04-14 01:47:44,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-14 01:47:44,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:44,312 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:44,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:47:44,312 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:47:44,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1088673399, now seen corresponding path program 1 times [2025-04-14 01:47:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:44,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688673814] [2025-04-14 01:47:44,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:44,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:47:44,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:47:44,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:44,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:44,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:44,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:47:44,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:47:44,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:44,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:44,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:44,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-14 01:47:44,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-14 01:47:44,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:47:44,340 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:44,340 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:47:44,340 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-14 01:47:44,387 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:47:44,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 63 transitions, 234 flow [2025-04-14 01:47:44,395 INFO L116 PetriNetUnfolderBase]: 7/83 cut-off events. [2025-04-14 01:47:44,395 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-14 01:47:44,395 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 8. Compared 292 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-14 01:47:44,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 63 transitions, 234 flow [2025-04-14 01:47:44,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 36 transitions, 129 flow [2025-04-14 01:47:44,398 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:44,398 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;@3fa0f96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:44,398 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-14 01:47:44,399 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:44,399 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-14 01:47:44,399 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:47:44,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:44,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:44,399 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-14 01:47:44,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1104694467, now seen corresponding path program 1 times [2025-04-14 01:47:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:44,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959344526] [2025-04-14 01:47:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:44,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:44,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:44,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:44,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:44,419 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-14 01:47:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:44,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959344526] [2025-04-14 01:47:44,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959344526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:44,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:47:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732055419] [2025-04-14 01:47:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:44,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:47:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:44,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:47:44,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:47:44,420 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 63 [2025-04-14 01:47:44,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:44,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:44,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 63 [2025-04-14 01:47:44,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:54,711 INFO L116 PetriNetUnfolderBase]: 226644/276299 cut-off events. [2025-04-14 01:47:54,711 INFO L117 PetriNetUnfolderBase]: For 37574/37574 co-relation queries the response was YES. [2025-04-14 01:47:55,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572117 conditions, 276299 events. 226644/276299 cut-off events. For 37574/37574 co-relation queries the response was YES. Maximal size of possible extension queue 5721. Compared 1349922 event pairs, 215724 based on Foata normal form. 0/259919 useless extension candidates. Maximal degree in co-relation 173456. Up to 275787 conditions per place. [2025-04-14 01:47:55,746 INFO L140 encePairwiseOnDemand]: 61/63 looper letters, 33 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2025-04-14 01:47:55,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 35 transitions, 195 flow [2025-04-14 01:47:55,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:47:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:47:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-14 01:47:55,748 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.21693121693121692 [2025-04-14 01:47:55,748 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 129 flow. Second operand 3 states and 41 transitions. [2025-04-14 01:47:55,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 35 transitions, 195 flow [2025-04-14 01:47:56,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 35 transitions, 174 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:56,356 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 108 flow [2025-04-14 01:47:56,356 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-14 01:47:56,356 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2025-04-14 01:47:56,356 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 108 flow [2025-04-14 01:47:56,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 01:47:56,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:56,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:56,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:47:56,357 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-14 01:47:56,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash -790198002, now seen corresponding path program 1 times [2025-04-14 01:47:56,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:56,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377880995] [2025-04-14 01:47:56,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:56,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:56,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:56,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:56,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:56,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-14 01:47:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:56,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377880995] [2025-04-14 01:47:56,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377880995] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:56,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:47:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013062066] [2025-04-14 01:47:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:56,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:47:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:56,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:47:56,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:47:56,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 63 [2025-04-14 01:47:56,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:47:56,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:56,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 63 [2025-04-14 01:47:56,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:48:05,546 INFO L116 PetriNetUnfolderBase]: 226607/276234 cut-off events. [2025-04-14 01:48:05,546 INFO L117 PetriNetUnfolderBase]: For 11420/11420 co-relation queries the response was YES. [2025-04-14 01:48:06,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566972 conditions, 276234 events. 226607/276234 cut-off events. For 11420/11420 co-relation queries the response was YES. Maximal size of possible extension queue 5581. Compared 1347147 event pairs, 178864 based on Foata normal form. 0/259866 useless extension candidates. Maximal degree in co-relation 566960. Up to 275717 conditions per place. [2025-04-14 01:48:06,802 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 35 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-04-14 01:48:06,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 39 transitions, 192 flow [2025-04-14 01:48:06,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:48:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:48:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-14 01:48:06,803 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.1865079365079365 [2025-04-14 01:48:06,805 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 108 flow. Second operand 4 states and 47 transitions. [2025-04-14 01:48:06,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 39 transitions, 192 flow [2025-04-14 01:48:06,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 39 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:48:06,831 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 121 flow [2025-04-14 01:48:06,831 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-14 01:48:06,832 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-04-14 01:48:06,832 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 121 flow [2025-04-14 01:48:06,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 01:48:06,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:48:06,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:48:06,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 01:48:06,832 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-14 01:48:06,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:48:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 794117664, now seen corresponding path program 1 times [2025-04-14 01:48:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:48:06,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720392720] [2025-04-14 01:48:06,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:48:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:48:06,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:48:06,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:48:06,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:48:06,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:06,882 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-14 01:48:06,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:48:06,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720392720] [2025-04-14 01:48:06,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720392720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:48:06,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:48:06,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:48:06,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506696240] [2025-04-14 01:48:06,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:48:06,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:48:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:48:06,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:48:06,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:48:06,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 63 [2025-04-14 01:48:06,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-14 01:48:06,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:48:06,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 63 [2025-04-14 01:48:06,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:48:18,445 INFO L116 PetriNetUnfolderBase]: 278479/339018 cut-off events. [2025-04-14 01:48:18,445 INFO L117 PetriNetUnfolderBase]: For 16206/16206 co-relation queries the response was YES. [2025-04-14 01:48:19,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703463 conditions, 339018 events. 278479/339018 cut-off events. For 16206/16206 co-relation queries the response was YES. Maximal size of possible extension queue 6641. Compared 1696937 event pairs, 215695 based on Foata normal form. 0/322650 useless extension candidates. Maximal degree in co-relation 703449. Up to 275722 conditions per place. [2025-04-14 01:48:20,147 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-04-14 01:48:20,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 271 flow [2025-04-14 01:48:20,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:48:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:48:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-14 01:48:20,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25 [2025-04-14 01:48:20,149 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 121 flow. Second operand 4 states and 63 transitions. [2025-04-14 01:48:20,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 271 flow [2025-04-14 01:48:20,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:48:20,198 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 131 flow [2025-04-14 01:48:20,198 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-14 01:48:20,199 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-04-14 01:48:20,199 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 131 flow [2025-04-14 01:48:20,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-14 01:48:20,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:48:20,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:48:20,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 01:48:20,201 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-14 01:48:20,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:48:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1152155820, now seen corresponding path program 1 times [2025-04-14 01:48:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:48:20,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929127646] [2025-04-14 01:48:20,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:48:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:48:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:48:20,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:48:20,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:48:20,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:20,271 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-14 01:48:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:48:20,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929127646] [2025-04-14 01:48:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929127646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:48:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:48:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:48:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829077779] [2025-04-14 01:48:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:48:20,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:48:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:48:20,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:48:20,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:48:20,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 63 [2025-04-14 01:48:20,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-14 01:48:20,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:48:20,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 63 [2025-04-14 01:48:20,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand