/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:20:58,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:20:58,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:20:58,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:20:58,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:20:58,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:20:58,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:20:58,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:20:58,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:20:58,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:20:58,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:20:58,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:20:58,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:20:58,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:20:58,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:20:58,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:20:58,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:20:58,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:20:58,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:20:58,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:20:58,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:20:58,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:20:58,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:20:58,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:20:58,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:20:58,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:20:58,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:20:58,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:20:58,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:20:58,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:20:58,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:20:58,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:20:58,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:20:58,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:20:58,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:20:58,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:20:59,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:20:59,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:20:59,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:20:59,006 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:20:59,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i [2025-04-13 19:21:00,273 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059482104/3bd2860516db4e498d0ebd33407c3aa5/FLAGad0cd20ea [2025-04-13 19:21:00,518 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:21:00,519 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i [2025-04-13 19:21:00,532 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059482104/3bd2860516db4e498d0ebd33407c3aa5/FLAGad0cd20ea [2025-04-13 19:21:01,424 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059482104/3bd2860516db4e498d0ebd33407c3aa5 [2025-04-13 19:21:01,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:21:01,427 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:21:01,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:21:01,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:21:01,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:21:01,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5bdcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01, skipping insertion in model container [2025-04-13 19:21:01,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:21:01,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i[30703,30716] [2025-04-13 19:21:01,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:21:01,685 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:21:01,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i[30703,30716] [2025-04-13 19:21:01,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:21:01,744 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:21:01,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01 WrapperNode [2025-04-13 19:21:01,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:21:01,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:21:01,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:21:01,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:21:01,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,769 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-04-13 19:21:01,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:21:01,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:21:01,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:21:01,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:21:01,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,785 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 19:21:01,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:21:01,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:21:01,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:21:01,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:21:01,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (1/1) ... [2025-04-13 19:21:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:21:01,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:21:01,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:21:01,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:21:01,830 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-13 19:21:01,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-13 19:21:01,830 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:21:01,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:21:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:21:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:21:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:21:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:21:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:21:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:21:01,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:21:01,831 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:21:01,922 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:21:01,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:21:02,038 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:21:02,039 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:21:02,039 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:21:02,136 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:21:02,138 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 19:21:02,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:21:02 BoogieIcfgContainer [2025-04-13 19:21:02,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:21:02,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:21:02,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:21:02,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:21:02,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:21:01" (1/3) ... [2025-04-13 19:21:02,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c80b281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:21:02, skipping insertion in model container [2025-04-13 19:21:02,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:21:01" (2/3) ... [2025-04-13 19:21:02,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c80b281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:21:02, skipping insertion in model container [2025-04-13 19:21:02,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:21:02" (3/3) ... [2025-04-13 19:21:02,146 INFO L128 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2025-04-13 19:21:02,155 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:21:02,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 35_double_lock_p3_vs.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:21:02,156 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:21:02,189 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:02,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 60 flow [2025-04-13 19:21:02,235 INFO L116 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-04-13 19:21:02,237 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:02,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 25 events. 2/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-13 19:21:02,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 60 flow [2025-04-13 19:21:02,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 57 flow [2025-04-13 19:21:02,245 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:02,253 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;@b4228e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:02,253 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:21:02,258 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:02,258 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:21:02,258 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:02,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:02,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:02,261 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:21:02,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 221204191, now seen corresponding path program 1 times [2025-04-13 19:21:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:02,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076190688] [2025-04-13 19:21:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:02,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:02,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:02,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:02,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:02,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076190688] [2025-04-13 19:21:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076190688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537560114] [2025-04-13 19:21:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:02,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:02,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:02,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:02,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:02,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-04-13 19:21:02,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:02,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:02,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-04-13 19:21:02,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:02,515 INFO L116 PetriNetUnfolderBase]: 117/218 cut-off events. [2025-04-13 19:21:02,515 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:21:02,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 218 events. 117/218 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 698 event pairs, 89 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 419. Up to 197 conditions per place. [2025-04-13 19:21:02,518 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 16 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2025-04-13 19:21:02,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 83 flow [2025-04-13 19:21:02,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-13 19:21:02,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-04-13 19:21:02,550 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 57 flow. Second operand 3 states and 36 transitions. [2025-04-13 19:21:02,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 83 flow [2025-04-13 19:21:02,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 82 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:02,555 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 50 flow [2025-04-13 19:21:02,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-04-13 19:21:02,560 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-04-13 19:21:02,560 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 50 flow [2025-04-13 19:21:02,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:02,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:02,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:21:02,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:21:02,560 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:21:02,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1733493125, now seen corresponding path program 1 times [2025-04-13 19:21:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:02,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959198688] [2025-04-13 19:21:02,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:02,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:21:02,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:21:02,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:02,586 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:21:02,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:21:02,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:02,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:02,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:02,616 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:02,617 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:21:02,619 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:21:02,619 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:21:02,619 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:21:02,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:21:02,620 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:21:02,621 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:02,621 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:21:02,643 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:02,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 110 flow [2025-04-13 19:21:02,651 INFO L116 PetriNetUnfolderBase]: 3/38 cut-off events. [2025-04-13 19:21:02,651 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:21:02,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 3/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-04-13 19:21:02,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 45 transitions, 110 flow [2025-04-13 19:21:02,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 36 transitions, 85 flow [2025-04-13 19:21:02,653 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:02,653 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;@b4228e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:02,653 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:21:02,656 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:02,656 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:21:02,656 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:21:02,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:02,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:02,657 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:21:02,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 264694084, now seen corresponding path program 1 times [2025-04-13 19:21:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:02,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845538049] [2025-04-13 19:21:02,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:02,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:02,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:02,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:02,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:02,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845538049] [2025-04-13 19:21:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845538049] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708561104] [2025-04-13 19:21:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:02,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:02,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:02,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:02,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:02,699 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2025-04-13 19:21:02,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:02,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:02,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2025-04-13 19:21:02,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:02,958 INFO L116 PetriNetUnfolderBase]: 1773/2625 cut-off events. [2025-04-13 19:21:02,958 INFO L117 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-04-13 19:21:02,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5249 conditions, 2625 events. 1773/2625 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11416 event pairs, 1439 based on Foata normal form. 0/2444 useless extension candidates. Maximal degree in co-relation 5238. Up to 2501 conditions per place. [2025-04-13 19:21:02,973 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 26 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2025-04-13 19:21:02,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 131 flow [2025-04-13 19:21:02,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-13 19:21:02,975 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-04-13 19:21:02,975 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 85 flow. Second operand 3 states and 55 transitions. [2025-04-13 19:21:02,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 131 flow [2025-04-13 19:21:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:02,977 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 78 flow [2025-04-13 19:21:02,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-04-13 19:21:02,978 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-04-13 19:21:02,978 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 78 flow [2025-04-13 19:21:02,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:02,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:02,978 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:02,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:21:02,978 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:21:02,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:02,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1192358819, now seen corresponding path program 1 times [2025-04-13 19:21:02,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:02,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695682159] [2025-04-13 19:21:02,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:02,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:21:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:21:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:02,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:03,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:21:03,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:21:03,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:03,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:03,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:03,017 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:03,017 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:21:03,017 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:21:03,017 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:21:03,017 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:21:03,017 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:21:03,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:21:03,018 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:21:03,018 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:03,018 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:21:03,050 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:03,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 164 flow [2025-04-13 19:21:03,056 INFO L116 PetriNetUnfolderBase]: 4/51 cut-off events. [2025-04-13 19:21:03,057 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:21:03,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 51 events. 4/51 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2025-04-13 19:21:03,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 164 flow [2025-04-13 19:21:03,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 47 transitions, 115 flow [2025-04-13 19:21:03,059 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:03,060 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;@b4228e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:03,060 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:21:03,061 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:03,061 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 19:21:03,061 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:21:03,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:03,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:03,062 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:21:03,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash 326322723, now seen corresponding path program 1 times [2025-04-13 19:21:03,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:03,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006528761] [2025-04-13 19:21:03,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:03,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:03,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:03,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:03,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:03,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:03,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006528761] [2025-04-13 19:21:03,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006528761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:03,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:03,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144823282] [2025-04-13 19:21:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:03,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:03,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:03,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:03,107 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2025-04-13 19:21:03,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:03,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:03,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2025-04-13 19:21:03,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:04,738 INFO L116 PetriNetUnfolderBase]: 22509/29938 cut-off events. [2025-04-13 19:21:04,738 INFO L117 PetriNetUnfolderBase]: For 2192/2192 co-relation queries the response was YES. [2025-04-13 19:21:04,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60427 conditions, 29938 events. 22509/29938 cut-off events. For 2192/2192 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 153222 event pairs, 18773 based on Foata normal form. 0/27645 useless extension candidates. Maximal degree in co-relation 60415. Up to 29069 conditions per place. [2025-04-13 19:21:04,912 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 36 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2025-04-13 19:21:04,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 181 flow [2025-04-13 19:21:04,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-04-13 19:21:04,915 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 19:21:04,915 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 115 flow. Second operand 3 states and 74 transitions. [2025-04-13 19:21:04,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 181 flow [2025-04-13 19:21:04,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 178 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:04,918 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 106 flow [2025-04-13 19:21:04,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-04-13 19:21:04,918 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-04-13 19:21:04,918 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 106 flow [2025-04-13 19:21:04,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:04,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:04,919 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:04,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:21:04,919 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:21:04,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash -321763454, now seen corresponding path program 1 times [2025-04-13 19:21:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:04,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197582004] [2025-04-13 19:21:04,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:04,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:04,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:04,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:04,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:04,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:04,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:21:04,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:21:04,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:04,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:04,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:04,957 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:04,957 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:21:04,957 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:21:04,957 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:21:04,960 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:21:04,960 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:21:04,960 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:21:04,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:21:04,960 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:21:04,961 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:04,961 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:21:05,004 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:05,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 83 transitions, 222 flow [2025-04-13 19:21:05,013 INFO L116 PetriNetUnfolderBase]: 5/64 cut-off events. [2025-04-13 19:21:05,013 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:21:05,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 64 events. 5/64 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 177 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 80. Up to 5 conditions per place. [2025-04-13 19:21:05,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 83 transitions, 222 flow [2025-04-13 19:21:05,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 58 transitions, 147 flow [2025-04-13 19:21:05,016 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:05,017 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;@b4228e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:05,017 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:21:05,018 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:05,018 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:21:05,018 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:21:05,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:05,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:05,018 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:21:05,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash 406090108, now seen corresponding path program 1 times [2025-04-13 19:21:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:05,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039083483] [2025-04-13 19:21:05,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:05,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:05,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:05,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:05,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:05,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039083483] [2025-04-13 19:21:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039083483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:05,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271767096] [2025-04-13 19:21:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:05,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:05,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:05,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:05,057 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2025-04-13 19:21:05,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:05,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:05,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2025-04-13 19:21:05,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:21:19,099 INFO L116 PetriNetUnfolderBase]: 261621/328196 cut-off events. [2025-04-13 19:21:19,099 INFO L117 PetriNetUnfolderBase]: For 33350/33350 co-relation queries the response was YES. [2025-04-13 19:21:19,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664866 conditions, 328196 events. 261621/328196 cut-off events. For 33350/33350 co-relation queries the response was YES. Maximal size of possible extension queue 6308. Compared 1844884 event pairs, 221435 based on Foata normal form. 0/301091 useless extension candidates. Maximal degree in co-relation 664853. Up to 320669 conditions per place. [2025-04-13 19:21:20,540 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 46 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-04-13 19:21:20,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 233 flow [2025-04-13 19:21:20,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:21:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:21:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-04-13 19:21:20,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37349397590361444 [2025-04-13 19:21:20,542 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 147 flow. Second operand 3 states and 93 transitions. [2025-04-13 19:21:20,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 54 transitions, 233 flow [2025-04-13 19:21:20,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 226 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:21:20,568 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 134 flow [2025-04-13 19:21:20,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-04-13 19:21:20,569 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-04-13 19:21:20,569 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 134 flow [2025-04-13 19:21:20,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:20,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:20,569 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:21:20,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:21:20,570 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:21:20,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1207446026, now seen corresponding path program 1 times [2025-04-13 19:21:20,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:20,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653604894] [2025-04-13 19:21:20,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:20,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:20,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:21:20,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:21:20,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:20,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:20,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:21:20,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:21:20,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:21:20,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:20,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:21:20,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:21:20,590 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:21:20,590 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 19:21:20,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:21:20,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:21:20,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 19:21:20,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 19:21:20,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:21:20,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:21:20,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:21:20,590 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:21:20,591 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:21:20,591 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:21:20,623 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:21:20,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 102 transitions, 284 flow [2025-04-13 19:21:20,630 INFO L116 PetriNetUnfolderBase]: 6/77 cut-off events. [2025-04-13 19:21:20,630 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:21:20,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 77 events. 6/77 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 223 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 99. Up to 6 conditions per place. [2025-04-13 19:21:20,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 102 transitions, 284 flow [2025-04-13 19:21:20,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 69 transitions, 181 flow [2025-04-13 19:21:20,632 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:21:20,633 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;@b4228e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:21:20,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:21:20,633 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:21:20,633 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:21:20,633 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:21:20,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:21:20,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:21:20,634 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 19:21:20,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:21:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 503968435, now seen corresponding path program 1 times [2025-04-13 19:21:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:21:20,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784971701] [2025-04-13 19:21:20,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:21:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:21:20,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:21:20,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:21:20,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:21:20,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:21:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:21:20,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:21:20,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784971701] [2025-04-13 19:21:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784971701] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:21:20,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:21:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:21:20,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138791254] [2025-04-13 19:21:20,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:21:20,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:21:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:21:20,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:21:20,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:21:20,664 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 102 [2025-04-13 19:21:20,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:21:20,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:21:20,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 102 [2025-04-13 19:21:20,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand