/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/11_fmaxsymopt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:16:51,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:16:51,068 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:16:51,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:16:51,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:16:51,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:16:51,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:16:51,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:16:51,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:16:51,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:16:51,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:16:51,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:16:51,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:16:51,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:16:51,089 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:16:51,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:16:51,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:16:51,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:16:51,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:16:51,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:16:51,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:16:51,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:51,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:51,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:51,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:16:51,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:16:51,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:16:51,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:16:51,094 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:16:51,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:16:51,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:16:51,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:16:51,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:16:51,330 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:16:51,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2025-04-13 19:16:52,616 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd9be55c/5bf2d43c6e10410eb3cb78429ea451a1/FLAG19f8aee4a [2025-04-13 19:16:52,911 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:16:52,912 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2025-04-13 19:16:52,926 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd9be55c/5bf2d43c6e10410eb3cb78429ea451a1/FLAG19f8aee4a [2025-04-13 19:16:53,616 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd9be55c/5bf2d43c6e10410eb3cb78429ea451a1 [2025-04-13 19:16:53,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:16:53,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:16:53,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:53,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:16:53,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:16:53,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:53,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661af82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53, skipping insertion in model container [2025-04-13 19:16:53,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:53,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:16:53,876 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/11_fmaxsymopt.i[30863,30876] [2025-04-13 19:16:53,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:53,905 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:16:53,961 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/11_fmaxsymopt.i[30863,30876] [2025-04-13 19:16:53,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:53,986 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:16:53,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53 WrapperNode [2025-04-13 19:16:53,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:53,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:53,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:16:53,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:16:53,991 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:16:53" (1/1) ... [2025-04-13 19:16:54,000 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:16:53" (1/1) ... [2025-04-13 19:16:54,018 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-04-13 19:16:54,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:54,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:16:54,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:16:54,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:16:54,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,037 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-04-13 19:16:54,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:16:54,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:16:54,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:16:54,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:16:54,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (1/1) ... [2025-04-13 19:16:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:54,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:54,079 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:16:54,080 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:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:16:54,095 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:16:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:16:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:16:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:16:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:16:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:16:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:16:54,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:16:54,097 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:16:54,186 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:16:54,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:16:54,336 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:16:54,337 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:16:54,337 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:16:54,478 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:16:54,482 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:16:54,485 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 19:16:54,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:54 BoogieIcfgContainer [2025-04-13 19:16:54,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:16:54,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:16:54,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:16:54,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:16:54,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:16:53" (1/3) ... [2025-04-13 19:16:54,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2d5d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:54, skipping insertion in model container [2025-04-13 19:16:54,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:53" (2/3) ... [2025-04-13 19:16:54,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2d5d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:54, skipping insertion in model container [2025-04-13 19:16:54,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:54" (3/3) ... [2025-04-13 19:16:54,492 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-04-13 19:16:54,501 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:16:54,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 17 locations, 21 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 19:16:54,503 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:16:54,538 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:54,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 22 transitions, 48 flow [2025-04-13 19:16:54,589 INFO L116 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-04-13 19:16:54,590 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:54,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 4/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 29 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-04-13 19:16:54,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 22 transitions, 48 flow [2025-04-13 19:16:54,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 21 transitions, 46 flow [2025-04-13 19:16:54,606 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:54,619 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;@4369e38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:54,620 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:16:54,627 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:54,627 INFO L116 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-04-13 19:16:54,627 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:54,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:54,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:54,628 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:54,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash 267077815, now seen corresponding path program 1 times [2025-04-13 19:16:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:54,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571516065] [2025-04-13 19:16:54,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:54,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:54,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:54,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:54,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:54,861 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:16:54,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:54,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571516065] [2025-04-13 19:16:54,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571516065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459657879] [2025-04-13 19:16:54,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:54,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:54,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:54,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:54,894 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-04-13 19:16:54,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:54,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:54,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-04-13 19:16:54,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:54,956 INFO L116 PetriNetUnfolderBase]: 12/40 cut-off events. [2025-04-13 19:16:54,956 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:54,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 40 events. 12/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 9 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 64. Up to 35 conditions per place. [2025-04-13 19:16:54,957 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 14 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-13 19:16:54,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 74 flow [2025-04-13 19:16:54,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-13 19:16:54,967 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-04-13 19:16:54,968 INFO L175 Difference]: Start difference. First operand has 20 places, 21 transitions, 46 flow. Second operand 3 states and 29 transitions. [2025-04-13 19:16:54,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 74 flow [2025-04-13 19:16:54,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 74 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:54,975 INFO L231 Difference]: Finished difference. Result has 22 places, 19 transitions, 52 flow [2025-04-13 19:16:54,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=22, PETRI_TRANSITIONS=19} [2025-04-13 19:16:54,979 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2025-04-13 19:16:54,979 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 52 flow [2025-04-13 19:16:54,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:54,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:54,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:16:54,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:16:54,979 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:54,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -312236077, now seen corresponding path program 1 times [2025-04-13 19:16:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:54,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397907717] [2025-04-13 19:16:54,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:54,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:55,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397907717] [2025-04-13 19:16:55,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397907717] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:55,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535507594] [2025-04-13 19:16:55,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:55,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:55,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:55,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:16:55,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:55,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:55,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:55,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:55,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:55,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:55,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:55,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535507594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:55,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:55,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:16:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64021606] [2025-04-13 19:16:55,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:55,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:55,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:55,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:55,152 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-04-13 19:16:55,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 52 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:55,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:55,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-04-13 19:16:55,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:55,209 INFO L116 PetriNetUnfolderBase]: 12/43 cut-off events. [2025-04-13 19:16:55,210 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:55,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 43 events. 12/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 9 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 84. Up to 35 conditions per place. [2025-04-13 19:16:55,210 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 14 selfloop transitions, 5 changer transitions 0/22 dead transitions. [2025-04-13 19:16:55,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 102 flow [2025-04-13 19:16:55,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:16:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:16:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-04-13 19:16:55,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2025-04-13 19:16:55,212 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 52 flow. Second operand 6 states and 40 transitions. [2025-04-13 19:16:55,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 102 flow [2025-04-13 19:16:55,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 98 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:55,213 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 84 flow [2025-04-13 19:16:55,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2025-04-13 19:16:55,213 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-13 19:16:55,213 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 84 flow [2025-04-13 19:16:55,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:55,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:55,214 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 19:16:55,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 19:16:55,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:55,414 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:55,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:55,415 INFO L85 PathProgramCache]: Analyzing trace with hash -613585039, now seen corresponding path program 2 times [2025-04-13 19:16:55,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:55,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349798791] [2025-04-13 19:16:55,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:55,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 19:16:55,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:16:55,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:55,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:55,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349798791] [2025-04-13 19:16:55,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349798791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:55,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780648058] [2025-04-13 19:16:55,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:55,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:55,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:16:55,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 19:16:55,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:16:55,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:55,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:55,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:16:55,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:55,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:55,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780648058] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:55,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:55,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:16:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725393308] [2025-04-13 19:16:55,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:55,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:16:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:55,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:16:55,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:16:55,664 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-04-13 19:16:55,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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:16:55,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:55,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-04-13 19:16:55,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:55,719 INFO L116 PetriNetUnfolderBase]: 12/45 cut-off events. [2025-04-13 19:16:55,720 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 19:16:55,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 45 events. 12/45 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 9 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 75. Up to 35 conditions per place. [2025-04-13 19:16:55,720 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 14 selfloop transitions, 7 changer transitions 0/24 dead transitions. [2025-04-13 19:16:55,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 138 flow [2025-04-13 19:16:55,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:16:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:16:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2025-04-13 19:16:55,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26704545454545453 [2025-04-13 19:16:55,721 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 84 flow. Second operand 8 states and 47 transitions. [2025-04-13 19:16:55,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 138 flow [2025-04-13 19:16:55,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 24 transitions, 124 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:55,723 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 106 flow [2025-04-13 19:16:55,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2025-04-13 19:16:55,726 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-04-13 19:16:55,727 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 106 flow [2025-04-13 19:16:55,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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:16:55,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:55,727 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1] [2025-04-13 19:16:55,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:16:55,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 19:16:55,928 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:55,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1299092559, now seen corresponding path program 3 times [2025-04-13 19:16:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:55,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603937075] [2025-04-13 19:16:55,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:55,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 4 equivalence classes. [2025-04-13 19:16:55,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:55,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:16:55,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:55,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:55,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:16:55,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:55,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:55,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:55,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:55,997 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:55,998 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:16:55,999 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:16:55,999 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:16:55,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:16:55,999 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:16:56,001 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:56,002 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:16:56,019 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:56,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 84 flow [2025-04-13 19:16:56,029 INFO L116 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-04-13 19:16:56,030 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:16:56,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 39 events. 7/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2025-04-13 19:16:56,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 84 flow [2025-04-13 19:16:56,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 36 transitions, 82 flow [2025-04-13 19:16:56,031 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:56,031 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;@4369e38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:56,031 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:16:56,035 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:56,036 INFO L116 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-04-13 19:16:56,036 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:56,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:56,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:56,036 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:16:56,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 302401002, now seen corresponding path program 1 times [2025-04-13 19:16:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:56,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669711270] [2025-04-13 19:16:56,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:56,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:56,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:56,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:56,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:56,091 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:16:56,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:56,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669711270] [2025-04-13 19:16:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669711270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:56,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091100471] [2025-04-13 19:16:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:56,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:56,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:56,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:56,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2025-04-13 19:16:56,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:56,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:56,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2025-04-13 19:16:56,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:56,218 INFO L116 PetriNetUnfolderBase]: 322/575 cut-off events. [2025-04-13 19:16:56,218 INFO L117 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-04-13 19:16:56,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 575 events. 322/575 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2220 event pairs, 279 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 776. Up to 545 conditions per place. [2025-04-13 19:16:56,222 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 25 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-04-13 19:16:56,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 128 flow [2025-04-13 19:16:56,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-13 19:16:56,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-04-13 19:16:56,224 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 82 flow. Second operand 3 states and 48 transitions. [2025-04-13 19:16:56,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 128 flow [2025-04-13 19:16:56,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:56,225 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2025-04-13 19:16:56,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-04-13 19:16:56,225 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-04-13 19:16:56,225 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2025-04-13 19:16:56,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:56,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:56,225 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:56,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:16:56,226 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:16:56,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 233751836, now seen corresponding path program 1 times [2025-04-13 19:16:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:56,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227208552] [2025-04-13 19:16:56,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:56,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:56,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:56,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:56,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:56,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227208552] [2025-04-13 19:16:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227208552] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:56,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652963830] [2025-04-13 19:16:56,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:56,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:56,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:56,271 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:56,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:16:56,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:56,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:56,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652963830] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:56,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:16:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405729884] [2025-04-13 19:16:56,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:56,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:56,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:56,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:56,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2025-04-13 19:16:56,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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:16:56,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:56,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2025-04-13 19:16:56,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:56,463 INFO L116 PetriNetUnfolderBase]: 322/578 cut-off events. [2025-04-13 19:16:56,463 INFO L117 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-04-13 19:16:56,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 578 events. 322/578 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2220 event pairs, 279 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 1159. Up to 545 conditions per place. [2025-04-13 19:16:56,467 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 25 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2025-04-13 19:16:56,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 156 flow [2025-04-13 19:16:56,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:16:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:16:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-04-13 19:16:56,468 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28378378378378377 [2025-04-13 19:16:56,468 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 6 states and 63 transitions. [2025-04-13 19:16:56,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 156 flow [2025-04-13 19:16:56,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 152 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:56,470 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 116 flow [2025-04-13 19:16:56,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-04-13 19:16:56,470 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2025-04-13 19:16:56,470 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 116 flow [2025-04-13 19:16:56,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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:16:56,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:56,471 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-04-13 19:16:56,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:16:56,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:56,674 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:16:56,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash -499886145, now seen corresponding path program 2 times [2025-04-13 19:16:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:56,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237294733] [2025-04-13 19:16:56,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:56,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 19:16:56,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:56,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:56,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:56,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237294733] [2025-04-13 19:16:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237294733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:56,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437470320] [2025-04-13 19:16:56,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:56,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:56,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:56,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:56,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:16:56,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 19:16:56,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:56,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:56,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:56,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:16:56,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:56,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437470320] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:56,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:56,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:16:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063601725] [2025-04-13 19:16:56,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:56,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:16:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:56,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:16:56,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:16:56,868 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2025-04-13 19:16:56,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 116 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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:16:56,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:56,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2025-04-13 19:16:56,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:56,963 INFO L116 PetriNetUnfolderBase]: 322/580 cut-off events. [2025-04-13 19:16:56,963 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-13 19:16:56,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 580 events. 322/580 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2202 event pairs, 279 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 1150. Up to 545 conditions per place. [2025-04-13 19:16:56,968 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 25 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2025-04-13 19:16:56,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 192 flow [2025-04-13 19:16:56,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:16:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:16:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2025-04-13 19:16:56,970 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25 [2025-04-13 19:16:56,970 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 116 flow. Second operand 8 states and 74 transitions. [2025-04-13 19:16:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 192 flow [2025-04-13 19:16:56,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 37 transitions, 178 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:56,971 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 138 flow [2025-04-13 19:16:56,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-04-13 19:16:56,972 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2025-04-13 19:16:56,972 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 138 flow [2025-04-13 19:16:56,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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:16:56,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:56,972 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-04-13 19:16:56,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:16:57,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:57,177 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:16:57,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 367467359, now seen corresponding path program 3 times [2025-04-13 19:16:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:57,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676917831] [2025-04-13 19:16:57,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:57,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-04-13 19:16:57,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:16:57,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:16:57,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:57,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:57,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:16:57,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:16:57,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:57,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:57,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:57,217 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:57,217 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:16:57,217 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:16:57,217 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:16:57,217 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:16:57,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:16:57,218 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:16:57,218 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:57,218 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:16:57,241 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:57,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 52 transitions, 122 flow [2025-04-13 19:16:57,250 INFO L116 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-04-13 19:16:57,250 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:16:57,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 10/56 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 153 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2025-04-13 19:16:57,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 52 transitions, 122 flow [2025-04-13 19:16:57,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 120 flow [2025-04-13 19:16:57,251 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:57,252 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;@4369e38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:57,252 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:16:57,253 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:57,253 INFO L116 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-04-13 19:16:57,253 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:57,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:57,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:57,253 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:57,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 352038316, now seen corresponding path program 1 times [2025-04-13 19:16:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:57,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656857242] [2025-04-13 19:16:57,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:57,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:57,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:57,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:57,273 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:16:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:57,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656857242] [2025-04-13 19:16:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656857242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:57,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890436854] [2025-04-13 19:16:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:57,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:57,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:57,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:57,274 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2025-04-13 19:16:57,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:57,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:57,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2025-04-13 19:16:57,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:57,853 INFO L116 PetriNetUnfolderBase]: 5422/7870 cut-off events. [2025-04-13 19:16:57,854 INFO L117 PetriNetUnfolderBase]: For 651/651 co-relation queries the response was YES. [2025-04-13 19:16:57,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15952 conditions, 7870 events. 5422/7870 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 40092 event pairs, 4779 based on Foata normal form. 0/7175 useless extension candidates. Maximal degree in co-relation 7314. Up to 7645 conditions per place. [2025-04-13 19:16:57,904 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 36 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-04-13 19:16:57,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 184 flow [2025-04-13 19:16:57,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 19:16:57,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2025-04-13 19:16:57,905 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 120 flow. Second operand 3 states and 67 transitions. [2025-04-13 19:16:57,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 184 flow [2025-04-13 19:16:57,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 182 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:57,907 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 116 flow [2025-04-13 19:16:57,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-04-13 19:16:57,908 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-04-13 19:16:57,908 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 116 flow [2025-04-13 19:16:57,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:57,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:57,908 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:57,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:16:57,908 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:57,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 598915106, now seen corresponding path program 1 times [2025-04-13 19:16:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:57,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720073995] [2025-04-13 19:16:57,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:57,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:57,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:57,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:57,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:57,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720073995] [2025-04-13 19:16:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720073995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:57,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800603159] [2025-04-13 19:16:57,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:57,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:57,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:16:57,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:58,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:58,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:58,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:58,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:58,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:58,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800603159] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:58,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:58,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:16:58,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122207436] [2025-04-13 19:16:58,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:58,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:58,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:58,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:58,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:58,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2025-04-13 19:16:58,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:16:58,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:58,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2025-04-13 19:16:58,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:58,620 INFO L116 PetriNetUnfolderBase]: 5422/7873 cut-off events. [2025-04-13 19:16:58,620 INFO L117 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2025-04-13 19:16:58,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15868 conditions, 7873 events. 5422/7873 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 40055 event pairs, 4779 based on Foata normal form. 0/7178 useless extension candidates. Maximal degree in co-relation 15854. Up to 7645 conditions per place. [2025-04-13 19:16:58,669 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 36 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-13 19:16:58,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 210 flow [2025-04-13 19:16:58,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:16:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:16:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-13 19:16:58,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27564102564102566 [2025-04-13 19:16:58,671 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 116 flow. Second operand 6 states and 86 transitions. [2025-04-13 19:16:58,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 210 flow [2025-04-13 19:16:58,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 206 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:58,672 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 148 flow [2025-04-13 19:16:58,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-04-13 19:16:58,673 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-04-13 19:16:58,673 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 148 flow [2025-04-13 19:16:58,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:16:58,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:58,673 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:58,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:16:58,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 19:16:58,879 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:58,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1040541369, now seen corresponding path program 2 times [2025-04-13 19:16:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:58,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589189846] [2025-04-13 19:16:58,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:58,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:16:58,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:16:58,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:58,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:58,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589189846] [2025-04-13 19:16:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589189846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:58,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25088182] [2025-04-13 19:16:58,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:58,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:58,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:58,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:58,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:16:59,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:16:59,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:16:59,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:59,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:59,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:16:59,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:59,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25088182] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:59,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:16:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050708381] [2025-04-13 19:16:59,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:59,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:16:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:59,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:16:59,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:16:59,063 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2025-04-13 19:16:59,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:16:59,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:59,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2025-04-13 19:16:59,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:59,651 INFO L116 PetriNetUnfolderBase]: 5422/7875 cut-off events. [2025-04-13 19:16:59,651 INFO L117 PetriNetUnfolderBase]: For 362/362 co-relation queries the response was YES. [2025-04-13 19:16:59,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15889 conditions, 7875 events. 5422/7875 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 40121 event pairs, 4779 based on Foata normal form. 2/7183 useless extension candidates. Maximal degree in co-relation 15845. Up to 7645 conditions per place. [2025-04-13 19:16:59,692 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 36 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-04-13 19:16:59,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 50 transitions, 246 flow [2025-04-13 19:16:59,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:16:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:16:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-04-13 19:16:59,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24278846153846154 [2025-04-13 19:16:59,693 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 148 flow. Second operand 8 states and 101 transitions. [2025-04-13 19:16:59,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 50 transitions, 246 flow [2025-04-13 19:16:59,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 50 transitions, 232 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:59,695 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 170 flow [2025-04-13 19:16:59,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-04-13 19:16:59,696 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2025-04-13 19:16:59,696 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 170 flow [2025-04-13 19:16:59,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:16:59,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:59,696 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:59,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 19:16:59,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:59,897 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:59,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1907641305, now seen corresponding path program 3 times [2025-04-13 19:16:59,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:59,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955385411] [2025-04-13 19:16:59,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:59,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 4 equivalence classes. [2025-04-13 19:16:59,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:16:59,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:16:59,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:59,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:59,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:16:59,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:16:59,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:59,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:59,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:59,926 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:59,926 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:16:59,926 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:16:59,926 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:16:59,926 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:16:59,926 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:16:59,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:16:59,926 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:16:59,927 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:59,927 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:16:59,954 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:59,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 67 transitions, 162 flow [2025-04-13 19:16:59,961 INFO L116 PetriNetUnfolderBase]: 13/73 cut-off events. [2025-04-13 19:16:59,962 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:16:59,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 73 events. 13/73 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 221 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 66. Up to 5 conditions per place. [2025-04-13 19:16:59,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 67 transitions, 162 flow [2025-04-13 19:16:59,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 66 transitions, 160 flow [2025-04-13 19:16:59,963 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:59,963 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;@4369e38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:59,963 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:16:59,965 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:59,965 INFO L116 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-04-13 19:16:59,965 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:59,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:59,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:59,965 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:59,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash 415990653, now seen corresponding path program 1 times [2025-04-13 19:16:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:59,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002555773] [2025-04-13 19:16:59,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:59,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:59,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:59,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:59,983 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:16:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:59,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002555773] [2025-04-13 19:16:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002555773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157674213] [2025-04-13 19:16:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:59,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:59,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:59,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:59,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2025-04-13 19:16:59,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:59,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:59,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2025-04-13 19:16:59,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:04,849 INFO L116 PetriNetUnfolderBase]: 76422/100401 cut-off events. [2025-04-13 19:17:04,849 INFO L117 PetriNetUnfolderBase]: For 10907/10907 co-relation queries the response was YES. [2025-04-13 19:17:04,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204484 conditions, 100401 events. 76422/100401 cut-off events. For 10907/10907 co-relation queries the response was YES. Maximal size of possible extension queue 2063. Compared 577773 event pairs, 67779 based on Foata normal form. 0/91371 useless extension candidates. Maximal degree in co-relation 52162. Up to 98645 conditions per place. [2025-04-13 19:17:05,404 INFO L140 encePairwiseOnDemand]: 55/67 looper letters, 47 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-04-13 19:17:05,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 242 flow [2025-04-13 19:17:05,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:17:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:17:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-04-13 19:17:05,405 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42786069651741293 [2025-04-13 19:17:05,405 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 160 flow. Second operand 3 states and 86 transitions. [2025-04-13 19:17:05,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 242 flow [2025-04-13 19:17:05,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 236 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:05,412 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 148 flow [2025-04-13 19:17:05,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-04-13 19:17:05,413 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-04-13 19:17:05,413 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 148 flow [2025-04-13 19:17:05,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:05,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:05,413 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:05,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:17:05,414 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:17:05,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash 969902021, now seen corresponding path program 1 times [2025-04-13 19:17:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:05,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491812085] [2025-04-13 19:17:05,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:05,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:05,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:17:05,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:17:05,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:05,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:05,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491812085] [2025-04-13 19:17:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491812085] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:17:05,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022267886] [2025-04-13 19:17:05,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:17:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:17:05,453 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:17:05,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:17:05,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:17:05,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:17:05,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:05,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:05,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:17:05,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:17:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:05,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:17:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022267886] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:17:05,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:17:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:17:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654781743] [2025-04-13 19:17:05,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:17:05,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:17:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:05,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:17:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:17:05,554 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2025-04-13 19:17:05,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:17:05,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:05,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2025-04-13 19:17:05,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:10,648 INFO L116 PetriNetUnfolderBase]: 76422/100404 cut-off events. [2025-04-13 19:17:10,648 INFO L117 PetriNetUnfolderBase]: For 3628/3628 co-relation queries the response was YES. [2025-04-13 19:17:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202400 conditions, 100404 events. 76422/100404 cut-off events. For 3628/3628 co-relation queries the response was YES. Maximal size of possible extension queue 2063. Compared 577845 event pairs, 67779 based on Foata normal form. 0/91374 useless extension candidates. Maximal degree in co-relation 202385. Up to 98645 conditions per place. [2025-04-13 19:17:11,150 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 47 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-04-13 19:17:11,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 264 flow [2025-04-13 19:17:11,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:17:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:17:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-04-13 19:17:11,152 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27114427860696516 [2025-04-13 19:17:11,152 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 148 flow. Second operand 6 states and 109 transitions. [2025-04-13 19:17:11,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 264 flow [2025-04-13 19:17:11,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 260 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:17:11,155 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 180 flow [2025-04-13 19:17:11,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-04-13 19:17:11,156 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2025-04-13 19:17:11,156 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 180 flow [2025-04-13 19:17:11,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:17:11,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:11,156 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:11,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 19:17:11,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:17:11,359 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:17:11,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash 401880063, now seen corresponding path program 2 times [2025-04-13 19:17:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:11,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195589867] [2025-04-13 19:17:11,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:17:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:11,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:17:11,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:17:11,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:17:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:11,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195589867] [2025-04-13 19:17:11,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195589867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:17:11,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926454235] [2025-04-13 19:17:11,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:17:11,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:17:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:17:11,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:17:11,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:17:11,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:17:11,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:17:11,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:17:11,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:11,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:17:11,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:17:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:11,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:17:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926454235] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:17:11,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:17:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:17:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832366396] [2025-04-13 19:17:11,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:17:11,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:17:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:11,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:17:11,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:17:11,563 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2025-04-13 19:17:11,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 180 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:11,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:11,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2025-04-13 19:17:11,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:17,014 INFO L116 PetriNetUnfolderBase]: 76422/100406 cut-off events. [2025-04-13 19:17:17,014 INFO L117 PetriNetUnfolderBase]: For 3636/3636 co-relation queries the response was YES. [2025-04-13 19:17:17,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202421 conditions, 100406 events. 76422/100406 cut-off events. For 3636/3636 co-relation queries the response was YES. Maximal size of possible extension queue 2063. Compared 578074 event pairs, 67779 based on Foata normal form. 2/91379 useless extension candidates. Maximal degree in co-relation 202376. Up to 98645 conditions per place. [2025-04-13 19:17:17,636 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-04-13 19:17:17,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 63 transitions, 300 flow [2025-04-13 19:17:17,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:17:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:17:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-04-13 19:17:17,637 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23880597014925373 [2025-04-13 19:17:17,638 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 180 flow. Second operand 8 states and 128 transitions. [2025-04-13 19:17:17,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 63 transitions, 300 flow [2025-04-13 19:17:17,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 63 transitions, 286 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:17:17,643 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 202 flow [2025-04-13 19:17:17,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2025-04-13 19:17:17,643 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2025-04-13 19:17:17,643 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 202 flow [2025-04-13 19:17:17,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:17,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:17,644 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:17,854 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forcibly destroying the process [2025-04-13 19:17:17,858 WARN L724 oredProcess$PipePump]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] The stream was forcibly closed: stdIn [2025-04-13 19:17:17,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 19:17:17,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 19:17:17,859 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:17:17,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1092648127, now seen corresponding path program 3 times [2025-04-13 19:17:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:17,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875419267] [2025-04-13 19:17:17,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:17:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:17,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 4 equivalence classes. [2025-04-13 19:17:17,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:17:17,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:17:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:17,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:17,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:17:17,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:17:17,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:17,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:17,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:17,893 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:17,893 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:17:17,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:17:17,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:17:17,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:17:17,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:17:17,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:17:17,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 19:17:17,893 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:17:17,897 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:17,897 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:17:17,927 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:17,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 82 transitions, 204 flow [2025-04-13 19:17:17,933 INFO L116 PetriNetUnfolderBase]: 16/90 cut-off events. [2025-04-13 19:17:17,933 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:17:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 90 events. 16/90 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 293 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2025-04-13 19:17:17,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 82 transitions, 204 flow [2025-04-13 19:17:17,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 81 transitions, 202 flow [2025-04-13 19:17:17,936 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:17,936 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;@4369e38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:17,936 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:17:17,937 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:17,937 INFO L116 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-04-13 19:17:17,937 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:17:17,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:17,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:17:17,938 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:17:17,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 494256669, now seen corresponding path program 1 times [2025-04-13 19:17:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:17,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715759754] [2025-04-13 19:17:17,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:17,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:17:17,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:17:17,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:17,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:17,959 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:17:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:17,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715759754] [2025-04-13 19:17:17,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715759754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:17,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:17,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:17:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16918922] [2025-04-13 19:17:17,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:17,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:17:17,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:17,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:17:17,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:17:17,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 82 [2025-04-13 19:17:17,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:17:17,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:17,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 82 [2025-04-13 19:17:17,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand