/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/09_fmaxsym.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:16:42,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:16:43,014 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:43,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:16:43,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:16:43,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:16:43,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:16:43,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:16:43,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:16:43,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:16:43,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:16:43,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:16:43,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:16:43,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:16:43,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:16:43,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:16:43,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:43,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:43,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:16:43,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:16:43,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:16:43,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:16:43,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:16:43,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:16:43,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:16:43,043 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:43,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:16:43,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:16:43,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:16:43,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:16:43,304 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:16:43,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2025-04-13 19:16:44,578 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e4dfc0e/116fc7ead49348f6a7efee9405ee4f3c/FLAGc558b570a [2025-04-13 19:16:44,847 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:16:44,847 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2025-04-13 19:16:44,865 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e4dfc0e/116fc7ead49348f6a7efee9405ee4f3c/FLAGc558b570a [2025-04-13 19:16:45,629 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e4dfc0e/116fc7ead49348f6a7efee9405ee4f3c [2025-04-13 19:16:45,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:16:45,633 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:16:45,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:45,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:16:45,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:16:45,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:45" (1/1) ... [2025-04-13 19:16:45,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7008920e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:45, skipping insertion in model container [2025-04-13 19:16:45,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:45" (1/1) ... [2025-04-13 19:16:45,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:16:45,911 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/09_fmaxsym.i[30746,30759] [2025-04-13 19:16:45,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:45,940 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:16:45,982 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/09_fmaxsym.i[30746,30759] [2025-04-13 19:16:45,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:46,007 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:16:46,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46 WrapperNode [2025-04-13 19:16:46,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:46,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:46,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:16:46,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:16:46,012 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:46" (1/1) ... [2025-04-13 19:16:46,021 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:46" (1/1) ... [2025-04-13 19:16:46,040 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-04-13 19:16:46,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:46,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:16:46,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:16:46,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:16:46,049 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:46" (1/1) ... [2025-04-13 19:16:46,049 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:46" (1/1) ... [2025-04-13 19:16:46,051 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:46" (1/1) ... [2025-04-13 19:16:46,066 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:46,066 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:46" (1/1) ... [2025-04-13 19:16:46,067 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:46" (1/1) ... [2025-04-13 19:16:46,070 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:46" (1/1) ... [2025-04-13 19:16:46,071 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:46" (1/1) ... [2025-04-13 19:16:46,073 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:46" (1/1) ... [2025-04-13 19:16:46,074 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:46" (1/1) ... [2025-04-13 19:16:46,074 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:46" (1/1) ... [2025-04-13 19:16:46,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:16:46,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:16:46,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:16:46,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:16:46,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:46,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:46,102 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:46,104 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:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:16:46,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:16:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:16:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:16:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:16:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:16:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:16:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:16:46,121 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:46,209 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:16:46,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:16:46,340 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:16:46,340 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:16:46,340 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:16:46,476 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:46,481 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:46,483 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 19:16:46,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:46 BoogieIcfgContainer [2025-04-13 19:16:46,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:16:46,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:16:46,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:16:46,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:16:46,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:16:45" (1/3) ... [2025-04-13 19:16:46,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b922abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:46, skipping insertion in model container [2025-04-13 19:16:46,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (2/3) ... [2025-04-13 19:16:46,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b922abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:46, skipping insertion in model container [2025-04-13 19:16:46,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:46" (3/3) ... [2025-04-13 19:16:46,490 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-04-13 19:16:46,502 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:16:46,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 16 locations, 19 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 19:16:46,503 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:16:46,538 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:46,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 20 transitions, 44 flow [2025-04-13 19:16:46,585 INFO L116 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-04-13 19:16:46,588 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:46,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 20 events. 3/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-13 19:16:46,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 20 transitions, 44 flow [2025-04-13 19:16:46,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2025-04-13 19:16:46,598 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:46,608 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;@732f612b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:46,608 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:16:46,613 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:46,613 INFO L116 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-04-13 19:16:46,613 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:46,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:46,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:16:46,614 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:46,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash 251803826, now seen corresponding path program 1 times [2025-04-13 19:16:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:46,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70186411] [2025-04-13 19:16:46,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:46,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:16:46,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:16:46,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:46,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:46,811 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:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:46,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70186411] [2025-04-13 19:16:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70186411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:46,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:46,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961217901] [2025-04-13 19:16:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:46,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:46,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-13 19:16:46,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:46,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:46,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-13 19:16:46,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:46,898 INFO L116 PetriNetUnfolderBase]: 12/38 cut-off events. [2025-04-13 19:16:46,898 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 38 events. 12/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 9 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 62. Up to 35 conditions per place. [2025-04-13 19:16:46,900 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-04-13 19:16:46,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 72 flow [2025-04-13 19:16:46,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2025-04-13 19:16:46,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-13 19:16:46,910 INFO L175 Difference]: Start difference. First operand has 19 places, 19 transitions, 42 flow. Second operand 3 states and 25 transitions. [2025-04-13 19:16:46,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 72 flow [2025-04-13 19:16:46,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:46,915 INFO L231 Difference]: Finished difference. Result has 21 places, 18 transitions, 50 flow [2025-04-13 19:16:46,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=21, PETRI_TRANSITIONS=18} [2025-04-13 19:16:46,918 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 2 predicate places. [2025-04-13 19:16:46,918 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 18 transitions, 50 flow [2025-04-13 19:16:46,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:46,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:46,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:16:46,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:16:46,919 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:46,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash -785576028, now seen corresponding path program 1 times [2025-04-13 19:16:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:46,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129522151] [2025-04-13 19:16:46,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:46,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:46,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:46,992 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:46,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:46,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129522151] [2025-04-13 19:16:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129522151] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:46,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466310707] [2025-04-13 19:16:46,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:46,995 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:46,997 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:47,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:47,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:47,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:47,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:47,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:47,084 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:47,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:47,099 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:47,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466310707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:47,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:16:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059821875] [2025-04-13 19:16:47,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:47,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:47,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:47,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:47,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:47,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-13 19:16:47,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:47,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:47,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-13 19:16:47,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:47,164 INFO L116 PetriNetUnfolderBase]: 12/41 cut-off events. [2025-04-13 19:16:47,164 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:47,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 41 events. 12/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 9 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 82. Up to 35 conditions per place. [2025-04-13 19:16:47,165 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 14 selfloop transitions, 5 changer transitions 0/21 dead transitions. [2025-04-13 19:16:47,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 100 flow [2025-04-13 19:16:47,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:16:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:16:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2025-04-13 19:16:47,167 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2025-04-13 19:16:47,167 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 50 flow. Second operand 6 states and 34 transitions. [2025-04-13 19:16:47,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 100 flow [2025-04-13 19:16:47,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 96 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:47,168 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 82 flow [2025-04-13 19:16:47,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2025-04-13 19:16:47,169 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 9 predicate places. [2025-04-13 19:16:47,169 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 82 flow [2025-04-13 19:16:47,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:47,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:47,169 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 19:16:47,180 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:47,370 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:47,370 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:47,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1367775950, now seen corresponding path program 2 times [2025-04-13 19:16:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:47,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512330379] [2025-04-13 19:16:47,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 19:16:47,400 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:47,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:47,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:47,491 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:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:47,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512330379] [2025-04-13 19:16:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512330379] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:47,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075911552] [2025-04-13 19:16:47,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:47,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:47,494 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:47,496 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:47,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 19:16:47,557 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:47,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:47,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:47,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:16:47,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:47,576 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:47,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:47,610 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:47,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075911552] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:47,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:47,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:16:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876227666] [2025-04-13 19:16:47,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:47,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:16:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:47,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:16:47,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:16:47,612 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-13 19:16:47,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 82 flow. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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:47,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:47,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-13 19:16:47,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:47,663 INFO L116 PetriNetUnfolderBase]: 12/43 cut-off events. [2025-04-13 19:16:47,663 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 19:16:47,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 43 events. 12/43 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 9 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 73. Up to 35 conditions per place. [2025-04-13 19:16:47,664 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 14 selfloop transitions, 7 changer transitions 0/23 dead transitions. [2025-04-13 19:16:47,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 136 flow [2025-04-13 19:16:47,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:16:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:16:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2025-04-13 19:16:47,666 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24375 [2025-04-13 19:16:47,666 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 82 flow. Second operand 8 states and 39 transitions. [2025-04-13 19:16:47,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 136 flow [2025-04-13 19:16:47,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 122 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:47,668 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 104 flow [2025-04-13 19:16:47,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2025-04-13 19:16:47,668 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 17 predicate places. [2025-04-13 19:16:47,669 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 104 flow [2025-04-13 19:16:47,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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:47,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:47,669 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1] [2025-04-13 19:16:47,679 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:47,874 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:47,874 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:47,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash -222616718, now seen corresponding path program 3 times [2025-04-13 19:16:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:47,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947427406] [2025-04-13 19:16:47,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 4 equivalence classes. [2025-04-13 19:16:47,902 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:47,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:16:47,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:47,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:47,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:16:47,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:47,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:47,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:47,930 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:47,931 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:16:47,932 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:16:47,933 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:16:47,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:16:47,933 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:16:47,935 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:47,935 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:16:47,951 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:47,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2025-04-13 19:16:47,957 INFO L116 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-04-13 19:16:47,957 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:16:47,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-13 19:16:47,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2025-04-13 19:16:47,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 32 transitions, 74 flow [2025-04-13 19:16:47,959 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:47,959 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;@732f612b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:47,959 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:16:47,962 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:47,962 INFO L116 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-04-13 19:16:47,962 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:16:47,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:47,962 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-04-13 19:16:47,962 INFO L403 AbstractCegarLoop]: === Iteration 1 === 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:47,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1675515788, now seen corresponding path program 1 times [2025-04-13 19:16:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:47,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808247929] [2025-04-13 19:16:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:16:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:16:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:48,003 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:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:48,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808247929] [2025-04-13 19:16:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808247929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801225888] [2025-04-13 19:16:48,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:48,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:48,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:48,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:48,005 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 19:16:48,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 74 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:48,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:48,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 19:16:48,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:48,097 INFO L116 PetriNetUnfolderBase]: 322/567 cut-off events. [2025-04-13 19:16:48,098 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:16:48,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 567 events. 322/567 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2058 event pairs, 279 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 916. Up to 545 conditions per place. [2025-04-13 19:16:48,101 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-04-13 19:16:48,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 124 flow [2025-04-13 19:16:48,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-13 19:16:48,102 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2025-04-13 19:16:48,103 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 74 flow. Second operand 3 states and 40 transitions. [2025-04-13 19:16:48,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 124 flow [2025-04-13 19:16:48,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:48,104 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 80 flow [2025-04-13 19:16:48,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-04-13 19:16:48,104 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-04-13 19:16:48,104 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 80 flow [2025-04-13 19:16:48,104 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:48,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:48,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:48,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:16:48,105 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:48,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1430912323, now seen corresponding path program 1 times [2025-04-13 19:16:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:48,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965583351] [2025-04-13 19:16:48,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:48,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:48,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:48,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:48,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:48,132 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:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:48,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965583351] [2025-04-13 19:16:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965583351] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:48,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447164091] [2025-04-13 19:16:48,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:48,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:48,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:48,134 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:48,135 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:48,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:48,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:48,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:48,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:48,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:48,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:48,201 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:48,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:48,215 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:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447164091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:48,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:16:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991636841] [2025-04-13 19:16:48,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:48,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:48,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:48,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:48,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 19:16:48,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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:48,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:48,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 19:16:48,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:48,327 INFO L116 PetriNetUnfolderBase]: 322/570 cut-off events. [2025-04-13 19:16:48,327 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:16:48,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 570 events. 322/570 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2052 event pairs, 279 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 1151. Up to 545 conditions per place. [2025-04-13 19:16:48,333 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 25 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-04-13 19:16:48,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 152 flow [2025-04-13 19:16:48,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:16:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:16:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-04-13 19:16:48,335 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25757575757575757 [2025-04-13 19:16:48,335 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 80 flow. Second operand 6 states and 51 transitions. [2025-04-13 19:16:48,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 152 flow [2025-04-13 19:16:48,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 148 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:48,338 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 112 flow [2025-04-13 19:16:48,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-04-13 19:16:48,339 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2025-04-13 19:16:48,339 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 112 flow [2025-04-13 19:16:48,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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:48,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:48,339 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-04-13 19:16:48,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:16:48,539 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:48,540 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:48,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 839392204, now seen corresponding path program 2 times [2025-04-13 19:16:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:48,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845521755] [2025-04-13 19:16:48,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:48,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 19:16:48,551 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:48,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:48,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:48,602 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:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:48,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845521755] [2025-04-13 19:16:48,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845521755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:48,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060371814] [2025-04-13 19:16:48,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:48,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:48,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:48,604 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:48,606 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:48,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 19:16:48,672 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:48,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:48,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:48,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:16:48,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:48,691 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:48,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:48,725 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:48,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060371814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:48,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:48,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:16:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432047275] [2025-04-13 19:16:48,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:48,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:16:48,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:48,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:16:48,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:16:48,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 19:16:48,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:48,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:48,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 19:16:48,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:48,812 INFO L116 PetriNetUnfolderBase]: 322/572 cut-off events. [2025-04-13 19:16:48,812 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-13 19:16:48,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 572 events. 322/572 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2052 event pairs, 279 based on Foata normal form. 2/488 useless extension candidates. Maximal degree in co-relation 1142. Up to 545 conditions per place. [2025-04-13 19:16:48,815 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 25 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2025-04-13 19:16:48,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 188 flow [2025-04-13 19:16:48,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:16:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:16:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2025-04-13 19:16:48,817 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2196969696969697 [2025-04-13 19:16:48,817 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 112 flow. Second operand 8 states and 58 transitions. [2025-04-13 19:16:48,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 188 flow [2025-04-13 19:16:48,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 35 transitions, 174 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:48,818 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 134 flow [2025-04-13 19:16:48,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-04-13 19:16:48,819 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2025-04-13 19:16:48,819 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 134 flow [2025-04-13 19:16:48,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:48,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:48,819 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-04-13 19:16:48,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 19:16:49,020 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:49,020 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:49,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash 698184172, now seen corresponding path program 3 times [2025-04-13 19:16:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:49,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160259677] [2025-04-13 19:16:49,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:49,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-04-13 19:16:49,047 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:49,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:16:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:49,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:49,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:16:49,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:16:49,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:49,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:49,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:49,064 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:49,064 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:16:49,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:16:49,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:16:49,064 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:16:49,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:16:49,064 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:16:49,064 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:49,065 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:16:49,087 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 110 flow [2025-04-13 19:16:49,096 INFO L116 PetriNetUnfolderBase]: 7/50 cut-off events. [2025-04-13 19:16:49,097 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:16:49,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 7/50 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2025-04-13 19:16:49,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 46 transitions, 110 flow [2025-04-13 19:16:49,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 45 transitions, 108 flow [2025-04-13 19:16:49,098 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:49,098 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;@732f612b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:49,098 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:16:49,102 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:49,102 INFO L116 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-04-13 19:16:49,102 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:16:49,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:49,102 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:49,102 INFO L403 AbstractCegarLoop]: === Iteration 1 === 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:49,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2108143540, now seen corresponding path program 1 times [2025-04-13 19:16:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:49,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470325107] [2025-04-13 19:16:49,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:49,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:16:49,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:16:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:49,132 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:49,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:49,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470325107] [2025-04-13 19:16:49,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470325107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:49,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:49,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:49,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001321295] [2025-04-13 19:16:49,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:49,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:49,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:49,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:49,133 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2025-04-13 19:16:49,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:49,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:49,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2025-04-13 19:16:49,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:49,734 INFO L116 PetriNetUnfolderBase]: 5422/7819 cut-off events. [2025-04-13 19:16:49,735 INFO L117 PetriNetUnfolderBase]: For 653/653 co-relation queries the response was YES. [2025-04-13 19:16:49,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15901 conditions, 7819 events. 5422/7819 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 37880 event pairs, 4779 based on Foata normal form. 0/6490 useless extension candidates. Maximal degree in co-relation 6346. Up to 7645 conditions per place. [2025-04-13 19:16:49,789 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 36 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-04-13 19:16:49,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 178 flow [2025-04-13 19:16:49,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-13 19:16:49,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39855072463768115 [2025-04-13 19:16:49,791 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 108 flow. Second operand 3 states and 55 transitions. [2025-04-13 19:16:49,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 178 flow [2025-04-13 19:16:49,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 176 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:49,793 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 110 flow [2025-04-13 19:16:49,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-04-13 19:16:49,794 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-04-13 19:16:49,794 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 110 flow [2025-04-13 19:16:49,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:49,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:49,794 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:49,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:16:49,794 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:49,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:49,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1461993167, now seen corresponding path program 1 times [2025-04-13 19:16:49,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:49,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471416126] [2025-04-13 19:16:49,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:49,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:49,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:49,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:49,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:49,835 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:49,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:49,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471416126] [2025-04-13 19:16:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471416126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:49,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669711270] [2025-04-13 19:16:49,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:49,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:49,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:49,837 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:49,839 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:49,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:49,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:49,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:49,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:49,913 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:49,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:49,929 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:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669711270] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:49,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:16:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279535749] [2025-04-13 19:16:49,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:49,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:49,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:49,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:49,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2025-04-13 19:16:49,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 110 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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:49,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:49,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2025-04-13 19:16:49,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:50,471 INFO L116 PetriNetUnfolderBase]: 5422/7822 cut-off events. [2025-04-13 19:16:50,471 INFO L117 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-04-13 19:16:50,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 7822 events. 5422/7822 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 37869 event pairs, 4779 based on Foata normal form. 0/6493 useless extension candidates. Maximal degree in co-relation 15803. Up to 7645 conditions per place. [2025-04-13 19:16:50,512 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 36 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2025-04-13 19:16:50,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 204 flow [2025-04-13 19:16:50,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:16:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:16:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-13 19:16:50,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2463768115942029 [2025-04-13 19:16:50,513 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 110 flow. Second operand 6 states and 68 transitions. [2025-04-13 19:16:50,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 204 flow [2025-04-13 19:16:50,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 200 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:50,515 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 142 flow [2025-04-13 19:16:50,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-04-13 19:16:50,515 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-04-13 19:16:50,515 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 142 flow [2025-04-13 19:16:50,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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:50,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:50,518 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:50,524 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:50,718 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:50,719 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:50,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:50,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1357074700, now seen corresponding path program 2 times [2025-04-13 19:16:50,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:50,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185621861] [2025-04-13 19:16:50,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:50,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:50,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:16:50,729 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:50,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:50,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:50,773 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:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:50,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185621861] [2025-04-13 19:16:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185621861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:50,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915435891] [2025-04-13 19:16:50,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:16:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:50,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:50,776 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:50,777 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:50,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:16:50,832 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:50,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:16:50,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:50,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:16:50,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:50,845 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:50,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:50,875 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:50,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915435891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:50,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:50,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:16:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652963830] [2025-04-13 19:16:50,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:50,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:16:50,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:50,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:16:50,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:16:50,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2025-04-13 19:16:50,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 142 flow. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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:50,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:50,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2025-04-13 19:16:50,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:51,409 INFO L116 PetriNetUnfolderBase]: 5422/7824 cut-off events. [2025-04-13 19:16:51,410 INFO L117 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-04-13 19:16:51,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15838 conditions, 7824 events. 5422/7824 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 37917 event pairs, 4779 based on Foata normal form. 2/6498 useless extension candidates. Maximal degree in co-relation 15794. Up to 7645 conditions per place. [2025-04-13 19:16:51,442 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 36 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-04-13 19:16:51,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 240 flow [2025-04-13 19:16:51,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:16:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:16:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2025-04-13 19:16:51,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.20923913043478262 [2025-04-13 19:16:51,443 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 142 flow. Second operand 8 states and 77 transitions. [2025-04-13 19:16:51,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 240 flow [2025-04-13 19:16:51,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 47 transitions, 226 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:51,445 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 164 flow [2025-04-13 19:16:51,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-04-13 19:16:51,446 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2025-04-13 19:16:51,446 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 164 flow [2025-04-13 19:16:51,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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:51,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:51,446 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:51,452 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:51,646 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:51,647 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:51,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1942155628, now seen corresponding path program 3 times [2025-04-13 19:16:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:51,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718047242] [2025-04-13 19:16:51,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:51,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 4 equivalence classes. [2025-04-13 19:16:51,662 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:51,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:16:51,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:51,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:51,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:16:51,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:16:51,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:51,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:51,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:51,674 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:51,674 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:16:51,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:16:51,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:16:51,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:16:51,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:16:51,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:16:51,675 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:16:51,675 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:51,675 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:16:51,698 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:51,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 146 flow [2025-04-13 19:16:51,706 INFO L116 PetriNetUnfolderBase]: 9/65 cut-off events. [2025-04-13 19:16:51,706 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:16:51,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 65 events. 9/65 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 60. Up to 5 conditions per place. [2025-04-13 19:16:51,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 59 transitions, 146 flow [2025-04-13 19:16:51,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 58 transitions, 144 flow [2025-04-13 19:16:51,707 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:51,708 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;@732f612b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:51,708 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:16:51,711 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:51,711 INFO L116 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-04-13 19:16:51,711 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:16:51,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:51,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:51,711 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:51,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -13550394, now seen corresponding path program 1 times [2025-04-13 19:16:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:51,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237294733] [2025-04-13 19:16:51,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:51,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:51,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:51,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:51,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:51,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:51,740 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:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:51,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237294733] [2025-04-13 19:16:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237294733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792518545] [2025-04-13 19:16:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:51,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:51,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:51,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:51,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 59 [2025-04-13 19:16:51,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:51,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:51,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 59 [2025-04-13 19:16:51,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:56,390 INFO L116 PetriNetUnfolderBase]: 76422/100175 cut-off events. [2025-04-13 19:16:56,390 INFO L117 PetriNetUnfolderBase]: For 10857/10857 co-relation queries the response was YES. [2025-04-13 19:16:56,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204258 conditions, 100175 events. 76422/100175 cut-off events. For 10857/10857 co-relation queries the response was YES. Maximal size of possible extension queue 1966. Compared 553927 event pairs, 67779 based on Foata normal form. 0/82522 useless extension candidates. Maximal degree in co-relation 57026. Up to 98645 conditions per place. [2025-04-13 19:16:56,911 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 47 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-04-13 19:16:56,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 234 flow [2025-04-13 19:16:56,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-13 19:16:56,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3954802259887006 [2025-04-13 19:16:56,913 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 144 flow. Second operand 3 states and 70 transitions. [2025-04-13 19:16:56,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 234 flow [2025-04-13 19:16:56,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 228 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:56,921 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 140 flow [2025-04-13 19:16:56,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-04-13 19:16:56,922 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-04-13 19:16:56,922 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 140 flow [2025-04-13 19:16:56,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:56,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:56,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:16:56,922 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:56,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 345590046, now seen corresponding path program 1 times [2025-04-13 19:16:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:56,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477536477] [2025-04-13 19:16:56,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:16:56,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:56,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:56,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:56,964 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,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:56,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477536477] [2025-04-13 19:16:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477536477] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:56,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376121735] [2025-04-13 19:16:56,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:56,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:56,966 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:16:56,968 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:16:57,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:16:57,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:57,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:57,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:57,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:57,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:57,040 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,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:57,052 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,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376121735] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:57,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:57,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:16:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163967367] [2025-04-13 19:16:57,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:57,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:16:57,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:57,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:16:57,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:16:57,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 59 [2025-04-13 19:16:57,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:57,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:57,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 59 [2025-04-13 19:16:57,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:01,931 INFO L116 PetriNetUnfolderBase]: 76422/100178 cut-off events. [2025-04-13 19:17:01,931 INFO L117 PetriNetUnfolderBase]: For 3584/3584 co-relation queries the response was YES. [2025-04-13 19:17:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202174 conditions, 100178 events. 76422/100178 cut-off events. For 3584/3584 co-relation queries the response was YES. Maximal size of possible extension queue 1966. Compared 554040 event pairs, 67779 based on Foata normal form. 0/82525 useless extension candidates. Maximal degree in co-relation 202159. Up to 98645 conditions per place. [2025-04-13 19:17:02,495 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 47 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-04-13 19:17:02,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 256 flow [2025-04-13 19:17:02,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:17:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:17:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2025-04-13 19:17:02,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2401129943502825 [2025-04-13 19:17:02,497 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 140 flow. Second operand 6 states and 85 transitions. [2025-04-13 19:17:02,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 256 flow [2025-04-13 19:17:02,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 252 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:17:02,502 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 172 flow [2025-04-13 19:17:02,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-04-13 19:17:02,502 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-04-13 19:17:02,502 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 172 flow [2025-04-13 19:17:02,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:02,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:02,502 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:02,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:17:02,704 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:02,704 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:17:02,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 519934662, now seen corresponding path program 2 times [2025-04-13 19:17:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:02,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607859718] [2025-04-13 19:17:02,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:17:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:02,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:17:02,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 14 statements. [2025-04-13 19:17:02,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:17:02,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:17:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:02,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607859718] [2025-04-13 19:17:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607859718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:02,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:17:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753879043] [2025-04-13 19:17:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:02,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:17:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:02,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:17:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:17:02,758 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 59 [2025-04-13 19:17:02,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:02,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:02,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 59 [2025-04-13 19:17:02,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:07,431 INFO L116 PetriNetUnfolderBase]: 68780/91670 cut-off events. [2025-04-13 19:17:07,431 INFO L117 PetriNetUnfolderBase]: For 3165/3165 co-relation queries the response was YES. [2025-04-13 19:17:07,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183482 conditions, 91670 events. 68780/91670 cut-off events. For 3165/3165 co-relation queries the response was YES. Maximal size of possible extension queue 1800. Compared 541244 event pairs, 25779 based on Foata normal form. 0/77756 useless extension candidates. Maximal degree in co-relation 183445. Up to 49320 conditions per place. [2025-04-13 19:17:07,899 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 82 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2025-04-13 19:17:07,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 423 flow [2025-04-13 19:17:07,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:17:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:17:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-04-13 19:17:07,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5480225988700564 [2025-04-13 19:17:07,900 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 172 flow. Second operand 3 states and 97 transitions. [2025-04-13 19:17:07,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 423 flow [2025-04-13 19:17:07,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 409 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:17:07,904 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 162 flow [2025-04-13 19:17:07,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-04-13 19:17:07,905 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-04-13 19:17:07,905 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 162 flow [2025-04-13 19:17:07,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:07,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:07,905 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:07,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:17:07,905 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:07,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash -382390574, now seen corresponding path program 1 times [2025-04-13 19:17:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:07,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050708381] [2025-04-13 19:17:07,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:07,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:17:07,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:17:07,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:07,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:07,970 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:07,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:07,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050708381] [2025-04-13 19:17:07,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050708381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:17:07,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157674213] [2025-04-13 19:17:07,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:07,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:17:07,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:17:07,972 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:07,974 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:08,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:17:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:17:08,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:08,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:08,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:17:08,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:17:08,053 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:08,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:17:08,083 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:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157674213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:17:08,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:17:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 19:17:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318539016] [2025-04-13 19:17:08,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:17:08,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:17:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:17:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:17:08,084 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 59 [2025-04-13 19:17:08,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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:17:08,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:08,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 59 [2025-04-13 19:17:08,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:12,737 INFO L116 PetriNetUnfolderBase]: 68780/90172 cut-off events. [2025-04-13 19:17:12,737 INFO L117 PetriNetUnfolderBase]: For 7548/7548 co-relation queries the response was YES. [2025-04-13 19:17:12,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188650 conditions, 90172 events. 68780/90172 cut-off events. For 7548/7548 co-relation queries the response was YES. Maximal size of possible extension queue 1783. Compared 493115 event pairs, 60779 based on Foata normal form. 2/76066 useless extension candidates. Maximal degree in co-relation 188611. Up to 88781 conditions per place. [2025-04-13 19:17:13,246 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 46 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-04-13 19:17:13,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 58 transitions, 280 flow [2025-04-13 19:17:13,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:17:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:17:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2025-04-13 19:17:13,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.20127118644067796 [2025-04-13 19:17:13,247 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 162 flow. Second operand 8 states and 95 transitions. [2025-04-13 19:17:13,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 58 transitions, 280 flow [2025-04-13 19:17:13,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 58 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:17:13,357 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 192 flow [2025-04-13 19:17:13,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2025-04-13 19:17:13,358 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-04-13 19:17:13,358 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 192 flow [2025-04-13 19:17:13,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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:17:13,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:13,358 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:13,364 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:13,558 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,SelfDestructingSolverStorable15 [2025-04-13 19:17:13,559 INFO L403 AbstractCegarLoop]: === Iteration 5 === 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:13,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1718780882, now seen corresponding path program 2 times [2025-04-13 19:17:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:13,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519677938] [2025-04-13 19:17:13,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:17:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:13,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 19:17:13,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:17:13,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:17:13,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:13,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:13,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:17:13,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:17:13,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:13,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:13,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:13,596 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:13,596 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:17:13,596 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:17:13,596 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:17:13,601 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:17:13,601 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:17:13,601 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:17:13,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 19:17:13,601 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-04-13 19:17:13,601 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:13,601 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:17:13,636 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:13,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 72 transitions, 184 flow [2025-04-13 19:17:13,644 INFO L116 PetriNetUnfolderBase]: 11/80 cut-off events. [2025-04-13 19:17:13,644 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:17:13,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 80 events. 11/80 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 81. Up to 6 conditions per place. [2025-04-13 19:17:13,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 72 transitions, 184 flow [2025-04-13 19:17:13,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 182 flow [2025-04-13 19:17:13,646 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:13,646 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;@732f612b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:13,646 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:17:13,649 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:13,649 INFO L116 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-04-13 19:17:13,649 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:17:13,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:13,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:13,649 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:13,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1287477422, now seen corresponding path program 1 times [2025-04-13 19:17:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:13,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447145912] [2025-04-13 19:17:13,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:13,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:17:13,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:17:13,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:13,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:13,672 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:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:13,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447145912] [2025-04-13 19:17:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447145912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:13,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:17:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359438249] [2025-04-13 19:17:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:13,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:17:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:13,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:17:13,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:17:13,673 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 72 [2025-04-13 19:17:13,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:13,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:13,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 72 [2025-04-13 19:17:13,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand