/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:53:26,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:53:26,513 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 23:53:26,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:53:26,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:53:26,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:53:26,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:53:26,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:53:26,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:53:26,545 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:53:26,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:53:26,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:53:26,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:53:26,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:53:26,547 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:53:26,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:53:26,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:53:26,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:53:26,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:53:26,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:26,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:26,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:53:26,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:53:26,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:53:26,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:53:26,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:53:26,550 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:53:26,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:53:26,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:53:26,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:53:26,777 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:53:26,778 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:53:26,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2025-04-13 23:53:28,067 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eac7e86f/24d2623f85f0450ba0bd7f559d80a774/FLAGd20e3d70a [2025-04-13 23:53:28,277 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:53:28,278 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2025-04-13 23:53:28,287 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eac7e86f/24d2623f85f0450ba0bd7f559d80a774/FLAGd20e3d70a [2025-04-13 23:53:29,067 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eac7e86f/24d2623f85f0450ba0bd7f559d80a774 [2025-04-13 23:53:29,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:53:29,071 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:53:29,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:53:29,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:53:29,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:53:29,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67477dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29, skipping insertion in model container [2025-04-13 23:53:29,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:53:29,332 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/37_stack_lock_p0_vs_concur.i[31044,31057] [2025-04-13 23:53:29,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:53:29,349 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:53:29,405 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/37_stack_lock_p0_vs_concur.i[31044,31057] [2025-04-13 23:53:29,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:53:29,438 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:53:29,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29 WrapperNode [2025-04-13 23:53:29,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:53:29,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:53:29,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:53:29,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:53:29,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,469 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2025-04-13 23:53:29,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:53:29,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:53:29,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:53:29,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:53:29,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,486 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 5, 1]. The 2 writes are split as follows [0, 0, 2]. [2025-04-13 23:53:29,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:53:29,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:53:29,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:53:29,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:53:29,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (1/1) ... [2025-04-13 23:53:29,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:29,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:53:29,516 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 23:53:29,518 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 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:53:29,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 23:53:29,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:53:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:53:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:53:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:53:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:53:29,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:53:29,533 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:53:29,611 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:53:29,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:53:29,780 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:53:29,780 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:53:29,781 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:53:30,180 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:53:30,188 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:53:30,193 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:53:30,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:53:30 BoogieIcfgContainer [2025-04-13 23:53:30,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:53:30,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:53:30,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:53:30,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:53:30,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:53:29" (1/3) ... [2025-04-13 23:53:30,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c98975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:53:30, skipping insertion in model container [2025-04-13 23:53:30,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:29" (2/3) ... [2025-04-13 23:53:30,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c98975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:53:30, skipping insertion in model container [2025-04-13 23:53:30,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:53:30" (3/3) ... [2025-04-13 23:53:30,200 INFO L128 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2025-04-13 23:53:30,209 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:53:30,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 37_stack_lock_p0_vs_concur.i that has 2 procedures, 17 locations, 20 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:53:30,211 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:53:30,243 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:30,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 21 transitions, 46 flow [2025-04-13 23:53:30,285 INFO L116 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-04-13 23:53:30,288 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:30,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-13 23:53:30,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 21 transitions, 46 flow [2025-04-13 23:53:30,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 20 transitions, 44 flow [2025-04-13 23:53:30,298 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:30,310 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;@27b2cea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:30,310 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:53:30,314 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:30,315 INFO L116 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-04-13 23:53:30,315 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:30,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:30,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:30,316 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 23:53:30,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash 10745881, now seen corresponding path program 1 times [2025-04-13 23:53:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:30,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880878073] [2025-04-13 23:53:30,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:30,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:30,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:30,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:30,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:30,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:30,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:30,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:30,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:30,870 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:30,871 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:53:30,872 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:53:30,872 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:53:30,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:53:30,873 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:53:30,877 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:30,877 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:53:30,903 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:30,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 37 transitions, 84 flow [2025-04-13 23:53:30,920 INFO L116 PetriNetUnfolderBase]: 6/39 cut-off events. [2025-04-13 23:53:30,920 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:53:30,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 39 events. 6/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 93 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2025-04-13 23:53:30,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 37 transitions, 84 flow [2025-04-13 23:53:30,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 36 transitions, 82 flow [2025-04-13 23:53:30,923 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:30,923 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;@27b2cea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:30,923 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:53:30,929 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:30,930 INFO L116 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-04-13 23:53:30,930 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:53:30,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:30,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 23:53:30,931 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 23:53:30,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1449642658, now seen corresponding path program 1 times [2025-04-13 23:53:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:30,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572057023] [2025-04-13 23:53:30,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:31,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:53:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:53:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:31,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:31,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:31,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:53:31,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:53:31,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:31,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:31,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:31,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:31,220 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:53:31,221 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:53:31,221 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:53:31,221 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:53:31,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:53:31,221 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:53:31,224 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:31,224 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:53:31,252 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:31,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 124 flow [2025-04-13 23:53:31,270 INFO L116 PetriNetUnfolderBase]: 9/57 cut-off events. [2025-04-13 23:53:31,270 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:53:31,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 9/57 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 171 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2025-04-13 23:53:31,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 53 transitions, 124 flow [2025-04-13 23:53:31,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 122 flow [2025-04-13 23:53:31,273 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:31,273 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;@27b2cea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:31,273 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:53:31,280 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:31,280 INFO L116 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-04-13 23:53:31,280 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:53:31,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:31,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:31,280 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:53:31,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -178014947, now seen corresponding path program 1 times [2025-04-13 23:53:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:31,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574193873] [2025-04-13 23:53:31,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:31,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:53:31,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:53:31,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:31,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:31,467 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 23:53:31,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:31,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574193873] [2025-04-13 23:53:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574193873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:31,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498356779] [2025-04-13 23:53:31,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:31,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:53:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:31,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:53:31,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:53:31,487 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2025-04-13 23:53:31,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 23:53:31,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:31,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2025-04-13 23:53:31,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:32,487 INFO L116 PetriNetUnfolderBase]: 9241/13018 cut-off events. [2025-04-13 23:53:32,487 INFO L117 PetriNetUnfolderBase]: For 916/916 co-relation queries the response was YES. [2025-04-13 23:53:32,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26647 conditions, 13018 events. 9241/13018 cut-off events. For 916/916 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 61052 event pairs, 8327 based on Foata normal form. 0/12104 useless extension candidates. Maximal degree in co-relation 16632. Up to 13011 conditions per place. [2025-04-13 23:53:32,571 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 41 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-04-13 23:53:32,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 184 flow [2025-04-13 23:53:32,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:53:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:53:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-04-13 23:53:32,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:53:32,583 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 122 flow. Second operand 2 states and 53 transitions. [2025-04-13 23:53:32,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 184 flow [2025-04-13 23:53:32,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 182 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 23:53:32,589 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 100 flow [2025-04-13 23:53:32,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-04-13 23:53:32,597 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-04-13 23:53:32,597 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 100 flow [2025-04-13 23:53:32,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 23:53:32,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:32,597 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 23:53:32,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:53:32,598 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 23:53:32,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1855009982, now seen corresponding path program 1 times [2025-04-13 23:53:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:32,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508164581] [2025-04-13 23:53:32,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:32,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:53:32,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:53:32,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:32,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:32,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:53:32,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:53:32,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:32,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:32,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:32,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:32,889 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:53:32,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:53:32,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:53:32,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:53:32,889 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:53:32,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:53:32,889 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:53:32,890 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:32,890 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:53:32,917 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:32,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 69 transitions, 166 flow [2025-04-13 23:53:32,924 INFO L116 PetriNetUnfolderBase]: 12/75 cut-off events. [2025-04-13 23:53:32,924 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:53:32,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 75 events. 12/75 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 236 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 69. Up to 5 conditions per place. [2025-04-13 23:53:32,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 69 transitions, 166 flow [2025-04-13 23:53:32,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 68 transitions, 164 flow [2025-04-13 23:53:32,925 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:32,926 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;@27b2cea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:32,926 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:53:32,928 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:32,928 INFO L116 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-04-13 23:53:32,928 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:53:32,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:32,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:32,928 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 23:53:32,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash -879760094, now seen corresponding path program 1 times [2025-04-13 23:53:32,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:32,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208160722] [2025-04-13 23:53:32,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:33,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:53:33,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:53:33,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:33,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:33,111 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 23:53:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:33,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208160722] [2025-04-13 23:53:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208160722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:33,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:33,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745545915] [2025-04-13 23:53:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:33,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:53:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:33,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:53:33,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:53:33,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 69 [2025-04-13 23:53:33,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 23:53:33,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:33,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 69 [2025-04-13 23:53:33,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:42,271 INFO L116 PetriNetUnfolderBase]: 156121/201410 cut-off events. [2025-04-13 23:53:42,272 INFO L117 PetriNetUnfolderBase]: For 18428/18428 co-relation queries the response was YES. [2025-04-13 23:53:42,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412032 conditions, 201410 events. 156121/201410 cut-off events. For 18428/18428 co-relation queries the response was YES. Maximal size of possible extension queue 2664. Compared 1082349 event pairs, 141383 based on Foata normal form. 0/186672 useless extension candidates. Maximal degree in co-relation 149688. Up to 201363 conditions per place. [2025-04-13 23:53:43,360 INFO L140 encePairwiseOnDemand]: 56/69 looper letters, 54 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2025-04-13 23:53:43,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 246 flow [2025-04-13 23:53:43,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:53:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:53:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2025-04-13 23:53:43,361 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:53:43,361 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 164 flow. Second operand 2 states and 69 transitions. [2025-04-13 23:53:43,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 246 flow [2025-04-13 23:53:43,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 240 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 23:53:43,375 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 132 flow [2025-04-13 23:53:43,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=132, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-04-13 23:53:43,376 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2025-04-13 23:53:43,376 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 132 flow [2025-04-13 23:53:43,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 23:53:43,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:43,376 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:43,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:53:43,376 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:53:43,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1155822661, now seen corresponding path program 1 times [2025-04-13 23:53:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:43,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398979047] [2025-04-13 23:53:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:43,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:53:43,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:53:43,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:43,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:43,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:43,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:53:43,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:53:43,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:43,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:43,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:43,545 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:43,545 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:53:43,545 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:53:43,547 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:53:43,547 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:53:43,547 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:53:43,547 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:53:43,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:53:43,547 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:53:43,548 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:43,548 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:53:43,580 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:43,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 210 flow [2025-04-13 23:53:43,590 INFO L116 PetriNetUnfolderBase]: 15/93 cut-off events. [2025-04-13 23:53:43,590 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:53:43,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 93 events. 15/93 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 317 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2025-04-13 23:53:43,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 85 transitions, 210 flow [2025-04-13 23:53:43,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 84 transitions, 208 flow [2025-04-13 23:53:43,592 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:43,592 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;@27b2cea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:43,592 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:53:43,594 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:43,594 INFO L116 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-04-13 23:53:43,594 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 23:53:43,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:43,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:43,595 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 23:53:43,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash 178357913, now seen corresponding path program 1 times [2025-04-13 23:53:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:43,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795641952] [2025-04-13 23:53:43,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:43,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:53:43,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:53:43,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:43,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:43,751 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 23:53:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:43,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795641952] [2025-04-13 23:53:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795641952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:43,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:53:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091284095] [2025-04-13 23:53:43,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:43,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:53:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:43,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:53:43,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:53:43,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 85 [2025-04-13 23:53:43,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 23:53:43,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:43,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 85 [2025-04-13 23:53:43,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand