/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/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:34:25,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:34:25,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:34:25,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:34:25,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:34:25,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:34:25,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:34:25,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:34:25,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:34:25,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:34:25,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:34:25,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:34:25,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:34:25,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:34:25,434 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:34:25,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:34:25,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:34:25,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:34:25,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:34:25,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:34:25,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:34:25,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:34:25,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:34:25,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:34:25,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:34:25,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:34:25,436 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:34:25,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:34:25,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:34:25,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:34:25,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:34:25,645 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:34:25,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2025-04-14 01:34:26,940 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8a2cd1c/9e811c48c47f412486ddecf671466471/FLAG4627d7657 [2025-04-14 01:34:27,174 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:34:27,174 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2025-04-14 01:34:27,183 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8a2cd1c/9e811c48c47f412486ddecf671466471/FLAG4627d7657 [2025-04-14 01:34:28,141 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8a2cd1c/9e811c48c47f412486ddecf671466471 [2025-04-14 01:34:28,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:34:28,144 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:34:28,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:34:28,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:34:28,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:34:28,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7f280e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28, skipping insertion in model container [2025-04-14 01:34:28,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:34:28,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] [2025-04-14 01:34:28,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:34:28,374 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:34:28,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] [2025-04-14 01:34:28,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:34:28,436 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:34:28,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28 WrapperNode [2025-04-14 01:34:28,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:34:28,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:34:28,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:34:28,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:34:28,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,482 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 186 [2025-04-14 01:34:28,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:34:28,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:34:28,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:34:28,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:34:28,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,500 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 01:34:28,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:34:28,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:34:28,515 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:34:28,515 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:34:28,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (1/1) ... [2025-04-14 01:34:28,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:34:28,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:28,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:34:28,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:34:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:34:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:34:28,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:34:28,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:34:28,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:34:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:34:28,557 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:34:28,645 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:34:28,647 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:34:28,892 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:34:28,892 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:34:28,892 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:34:29,165 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:34:29,167 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:34:29,170 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:34:29,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:34:29 BoogieIcfgContainer [2025-04-14 01:34:29,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:34:29,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:34:29,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:34:29,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:34:29,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:34:28" (1/3) ... [2025-04-14 01:34:29,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3bd1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:34:29, skipping insertion in model container [2025-04-14 01:34:29,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:34:28" (2/3) ... [2025-04-14 01:34:29,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3bd1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:34:29, skipping insertion in model container [2025-04-14 01:34:29,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:34:29" (3/3) ... [2025-04-14 01:34:29,176 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-04-14 01:34:29,186 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:34:29,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 22 locations, 25 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:34:29,187 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:34:29,218 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:34:29,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 27 transitions, 68 flow [2025-04-14 01:34:29,261 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-14 01:34:29,263 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:34:29,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 6/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-14 01:34:29,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 27 transitions, 68 flow [2025-04-14 01:34:29,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 24 transitions, 60 flow [2025-04-14 01:34:29,276 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:34:29,286 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;@60746d7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:34:29,287 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:34:29,297 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:34:29,298 INFO L116 PetriNetUnfolderBase]: 6/23 cut-off events. [2025-04-14 01:34:29,298 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:34:29,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:29,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:29,298 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:34:29,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1647220508, now seen corresponding path program 1 times [2025-04-14 01:34:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:29,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880301085] [2025-04-14 01:34:29,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:29,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 01:34:29,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:34:29,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:29,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:29,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880301085] [2025-04-14 01:34:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880301085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:34:29,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:34:29,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:34:29,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305238385] [2025-04-14 01:34:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:34:29,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:34:29,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:29,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:34:29,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:34:29,597 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:34:29,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 60 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-14 01:34:29,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:29,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:34:29,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:29,688 INFO L116 PetriNetUnfolderBase]: 165/276 cut-off events. [2025-04-14 01:34:29,689 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-14 01:34:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 276 events. 165/276 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 874 event pairs, 42 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 512. Up to 185 conditions per place. [2025-04-14 01:34:29,693 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 33 selfloop transitions, 3 changer transitions 1/37 dead transitions. [2025-04-14 01:34:29,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 37 transitions, 169 flow [2025-04-14 01:34:29,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:34:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:34:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-14 01:34:29,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-04-14 01:34:29,704 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 60 flow. Second operand 3 states and 44 transitions. [2025-04-14 01:34:29,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 37 transitions, 169 flow [2025-04-14 01:34:29,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 37 transitions, 155 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:34:29,710 INFO L231 Difference]: Finished difference. Result has 24 places, 26 transitions, 71 flow [2025-04-14 01:34:29,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=24, PETRI_TRANSITIONS=26} [2025-04-14 01:34:29,715 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-04-14 01:34:29,715 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 26 transitions, 71 flow [2025-04-14 01:34:29,715 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-14 01:34:29,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:29,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:29,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:34:29,715 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:34:29,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1236772558, now seen corresponding path program 1 times [2025-04-14 01:34:29,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:29,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638064482] [2025-04-14 01:34:29,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:29,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:29,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:34:29,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:34:29,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:29,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:29,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:29,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638064482] [2025-04-14 01:34:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638064482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:34:29,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:34:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:34:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737242998] [2025-04-14 01:34:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:34:29,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:34:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:29,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:34:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:34:29,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:34:29,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 26 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:29,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:29,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:34:29,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:29,950 INFO L116 PetriNetUnfolderBase]: 127/221 cut-off events. [2025-04-14 01:34:29,950 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-14 01:34:29,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 221 events. 127/221 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 647 event pairs, 35 based on Foata normal form. 8/181 useless extension candidates. Maximal degree in co-relation 187. Up to 150 conditions per place. [2025-04-14 01:34:29,952 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 29 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2025-04-14 01:34:29,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 33 transitions, 153 flow [2025-04-14 01:34:29,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:34:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:34:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-14 01:34:29,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-04-14 01:34:29,953 INFO L175 Difference]: Start difference. First operand has 24 places, 26 transitions, 71 flow. Second operand 3 states and 38 transitions. [2025-04-14 01:34:29,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 33 transitions, 153 flow [2025-04-14 01:34:29,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 33 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:34:29,954 INFO L231 Difference]: Finished difference. Result has 26 places, 26 transitions, 78 flow [2025-04-14 01:34:29,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=26, PETRI_TRANSITIONS=26} [2025-04-14 01:34:29,955 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2025-04-14 01:34:29,955 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 26 transitions, 78 flow [2025-04-14 01:34:29,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:29,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:29,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:29,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:34:29,955 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:34:29,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1032114184, now seen corresponding path program 1 times [2025-04-14 01:34:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:29,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184803879] [2025-04-14 01:34:29,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:29,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:34:29,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:34:29,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:29,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:30,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184803879] [2025-04-14 01:34:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184803879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:34:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:34:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:34:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013379948] [2025-04-14 01:34:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:34:30,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:34:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:30,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:34:30,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:34:30,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:34:30,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:30,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:30,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:34:30,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:30,085 INFO L116 PetriNetUnfolderBase]: 89/165 cut-off events. [2025-04-14 01:34:30,085 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-14 01:34:30,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 165 events. 89/165 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 423 event pairs, 36 based on Foata normal form. 7/145 useless extension candidates. Maximal degree in co-relation 163. Up to 112 conditions per place. [2025-04-14 01:34:30,086 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 29 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2025-04-14 01:34:30,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 163 flow [2025-04-14 01:34:30,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:34:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:34:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:34:30,089 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2025-04-14 01:34:30,089 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 78 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:34:30,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 163 flow [2025-04-14 01:34:30,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 33 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:34:30,091 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 84 flow [2025-04-14 01:34:30,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2025-04-14 01:34:30,092 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2025-04-14 01:34:30,092 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 84 flow [2025-04-14 01:34:30,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:30,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:30,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:30,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:34:30,092 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:34:30,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1533180826, now seen corresponding path program 1 times [2025-04-14 01:34:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:30,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606907523] [2025-04-14 01:34:30,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:30,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:34:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:34:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:30,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606907523] [2025-04-14 01:34:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606907523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:34:30,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:34:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:34:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047113405] [2025-04-14 01:34:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:34:30,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:34:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:30,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:34:30,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:34:30,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:34:30,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:30,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:30,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:34:30,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:30,309 INFO L116 PetriNetUnfolderBase]: 92/178 cut-off events. [2025-04-14 01:34:30,309 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-14 01:34:30,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 178 events. 92/178 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 459 event pairs, 64 based on Foata normal form. 6/163 useless extension candidates. Maximal degree in co-relation 246. Up to 144 conditions per place. [2025-04-14 01:34:30,310 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 25 selfloop transitions, 2 changer transitions 10/37 dead transitions. [2025-04-14 01:34:30,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 185 flow [2025-04-14 01:34:30,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:34:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:34:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-14 01:34:30,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-04-14 01:34:30,313 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 84 flow. Second operand 4 states and 42 transitions. [2025-04-14 01:34:30,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 185 flow [2025-04-14 01:34:30,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:34:30,315 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 96 flow [2025-04-14 01:34:30,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-04-14 01:34:30,315 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-04-14 01:34:30,315 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 96 flow [2025-04-14 01:34:30,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:30,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:30,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:30,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:34:30,316 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:34:30,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 97354569, now seen corresponding path program 1 times [2025-04-14 01:34:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:30,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43639035] [2025-04-14 01:34:30,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:30,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:34:30,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:34:30,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:30,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:34:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:30,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43639035] [2025-04-14 01:34:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43639035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:34:30,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:34:30,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:34:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008491754] [2025-04-14 01:34:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:34:30,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:34:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:34:30,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:34:30,426 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:34:30,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-14 01:34:30,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:30,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:34:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:30,496 INFO L116 PetriNetUnfolderBase]: 89/173 cut-off events. [2025-04-14 01:34:30,496 INFO L117 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-04-14 01:34:30,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 173 events. 89/173 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 437 event pairs, 62 based on Foata normal form. 8/161 useless extension candidates. Maximal degree in co-relation 421. Up to 145 conditions per place. [2025-04-14 01:34:30,497 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 26 selfloop transitions, 2 changer transitions 8/36 dead transitions. [2025-04-14 01:34:30,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 192 flow [2025-04-14 01:34:30,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:34:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:34:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-14 01:34:30,498 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-04-14 01:34:30,498 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 96 flow. Second operand 4 states and 40 transitions. [2025-04-14 01:34:30,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 192 flow [2025-04-14 01:34:30,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 184 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 01:34:30,499 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 104 flow [2025-04-14 01:34:30,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2025-04-14 01:34:30,500 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2025-04-14 01:34:30,500 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 104 flow [2025-04-14 01:34:30,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-14 01:34:30,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:30,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:30,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:34:30,500 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:34:30,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -634711273, now seen corresponding path program 1 times [2025-04-14 01:34:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:30,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115874182] [2025-04-14 01:34:30,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:34:30,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:34:30,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:30,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:32,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115874182] [2025-04-14 01:34:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115874182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:32,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196866025] [2025-04-14 01:34:32,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:32,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:32,116 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-14 01:34:32,117 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-14 01:34:32,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:34:32,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:34:32,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:32,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:32,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 01:34:32,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:32,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:34:32,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:34:32,406 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:34:32,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:34:32,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:34:33,031 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-04-14 01:34:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:33,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:38,597 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:34:38,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 332 [2025-04-14 01:34:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:39,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196866025] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:39,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:39,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-14 01:34:39,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142957453] [2025-04-14 01:34:39,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:39,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:34:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:39,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:34:39,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1202, Unknown=1, NotChecked=0, Total=1332 [2025-04-14 01:34:39,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:34:39,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 104 flow. Second operand has 37 states, 37 states have (on average 3.5405405405405403) internal successors, (131), 37 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:39,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:39,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:34:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:55,050 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:06,465 INFO L116 PetriNetUnfolderBase]: 576/1078 cut-off events. [2025-04-14 01:35:06,466 INFO L117 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2025-04-14 01:35:06,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 1078 events. 576/1078 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5305 event pairs, 12 based on Foata normal form. 4/942 useless extension candidates. Maximal degree in co-relation 2157. Up to 242 conditions per place. [2025-04-14 01:35:06,471 INFO L140 encePairwiseOnDemand]: 11/27 looper letters, 193 selfloop transitions, 208 changer transitions 13/414 dead transitions. [2025-04-14 01:35:06,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 414 transitions, 2087 flow [2025-04-14 01:35:06,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-04-14 01:35:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2025-04-14 01:35:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 599 transitions. [2025-04-14 01:35:06,475 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24114331723027374 [2025-04-14 01:35:06,476 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 104 flow. Second operand 92 states and 599 transitions. [2025-04-14 01:35:06,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 414 transitions, 2087 flow [2025-04-14 01:35:06,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 414 transitions, 2061 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-14 01:35:06,485 INFO L231 Difference]: Finished difference. Result has 129 places, 244 transitions, 1347 flow [2025-04-14 01:35:06,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=1347, PETRI_PLACES=129, PETRI_TRANSITIONS=244} [2025-04-14 01:35:06,486 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 104 predicate places. [2025-04-14 01:35:06,486 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 244 transitions, 1347 flow [2025-04-14 01:35:06,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5405405405405403) internal successors, (131), 37 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:06,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:06,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:06,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:35:06,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:35:06,687 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:06,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1056111027, now seen corresponding path program 2 times [2025-04-14 01:35:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:06,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670960761] [2025-04-14 01:35:06,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:06,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:06,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-04-14 01:35:06,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:35:06,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:35:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:06,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670960761] [2025-04-14 01:35:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670960761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:06,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:35:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535409486] [2025-04-14 01:35:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:06,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:35:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:06,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:35:06,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:35:06,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:06,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 244 transitions, 1347 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:06,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:06,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:06,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:07,316 INFO L116 PetriNetUnfolderBase]: 606/1125 cut-off events. [2025-04-14 01:35:07,317 INFO L117 PetriNetUnfolderBase]: For 551/551 co-relation queries the response was YES. [2025-04-14 01:35:07,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3748 conditions, 1125 events. 606/1125 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5547 event pairs, 24 based on Foata normal form. 2/1000 useless extension candidates. Maximal degree in co-relation 3691. Up to 843 conditions per place. [2025-04-14 01:35:07,323 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 216 selfloop transitions, 64 changer transitions 2/282 dead transitions. [2025-04-14 01:35:07,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 282 transitions, 2076 flow [2025-04-14 01:35:07,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:35:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:35:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2025-04-14 01:35:07,325 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2025-04-14 01:35:07,325 INFO L175 Difference]: Start difference. First operand has 129 places, 244 transitions, 1347 flow. Second operand 10 states and 83 transitions. [2025-04-14 01:35:07,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 282 transitions, 2076 flow [2025-04-14 01:35:07,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 282 transitions, 1764 flow, removed 149 selfloop flow, removed 5 redundant places. [2025-04-14 01:35:07,344 INFO L231 Difference]: Finished difference. Result has 138 places, 263 transitions, 1384 flow [2025-04-14 01:35:07,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1384, PETRI_PLACES=138, PETRI_TRANSITIONS=263} [2025-04-14 01:35:07,345 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 113 predicate places. [2025-04-14 01:35:07,345 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 263 transitions, 1384 flow [2025-04-14 01:35:07,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:07,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:07,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:07,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:35:07,345 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:07,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -197831143, now seen corresponding path program 3 times [2025-04-14 01:35:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:07,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644708391] [2025-04-14 01:35:07,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:35:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:07,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:07,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-04-14 01:35:07,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:35:07,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:35:07,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:07,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644708391] [2025-04-14 01:35:07,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644708391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:07,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:07,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:35:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014272069] [2025-04-14 01:35:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:07,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:35:07,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:07,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:35:07,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:35:07,644 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:07,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 263 transitions, 1384 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:07,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:07,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:07,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:08,200 INFO L116 PetriNetUnfolderBase]: 656/1209 cut-off events. [2025-04-14 01:35:08,201 INFO L117 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2025-04-14 01:35:08,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 1209 events. 656/1209 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6110 event pairs, 28 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 3901. Up to 923 conditions per place. [2025-04-14 01:35:08,207 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 234 selfloop transitions, 72 changer transitions 1/307 dead transitions. [2025-04-14 01:35:08,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 307 transitions, 2200 flow [2025-04-14 01:35:08,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:35:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:35:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2025-04-14 01:35:08,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2025-04-14 01:35:08,209 INFO L175 Difference]: Start difference. First operand has 138 places, 263 transitions, 1384 flow. Second operand 10 states and 83 transitions. [2025-04-14 01:35:08,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 307 transitions, 2200 flow [2025-04-14 01:35:08,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 307 transitions, 2152 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-04-14 01:35:08,222 INFO L231 Difference]: Finished difference. Result has 149 places, 286 transitions, 1739 flow [2025-04-14 01:35:08,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1739, PETRI_PLACES=149, PETRI_TRANSITIONS=286} [2025-04-14 01:35:08,224 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 124 predicate places. [2025-04-14 01:35:08,224 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 286 transitions, 1739 flow [2025-04-14 01:35:08,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:08,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:08,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:08,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:35:08,224 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:08,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 23813897, now seen corresponding path program 4 times [2025-04-14 01:35:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:08,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071952239] [2025-04-14 01:35:08,225 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:08,233 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:08,251 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:08,252 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:08,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:09,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071952239] [2025-04-14 01:35:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071952239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:09,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416275543] [2025-04-14 01:35:09,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:09,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:09,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:09,748 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-14 01:35:09,749 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-14 01:35:09,788 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:09,804 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:09,804 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:09,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:09,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 01:35:09,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:09,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:35:10,301 INFO L325 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-04-14 01:35:10,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 20 [2025-04-14 01:35:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:35:10,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:11,203 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:11,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2025-04-14 01:35:11,621 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:35:11,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2025-04-14 01:35:11,634 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:35:11,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-04-14 01:35:11,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:11,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-14 01:35:11,864 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:11,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2025-04-14 01:35:11,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:11,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-04-14 01:35:11,890 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:35:11,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2025-04-14 01:35:11,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:11,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-04-14 01:35:11,910 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:35:11,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-04-14 01:35:11,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:11,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-04-14 01:35:11,955 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:35:11,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-04-14 01:35:11,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:11,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-04-14 01:35:11,976 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:35:11,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2025-04-14 01:35:11,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:11,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-04-14 01:35:12,026 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:12,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 80 [2025-04-14 01:35:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:35:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416275543] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:35:12,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:35:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2025-04-14 01:35:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007267881] [2025-04-14 01:35:12,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:35:12,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 01:35:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:12,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 01:35:12,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:35:12,274 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:12,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 286 transitions, 1739 flow. Second operand has 36 states, 36 states have (on average 3.5833333333333335) internal successors, (129), 36 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:12,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:12,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:12,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:15,578 INFO L116 PetriNetUnfolderBase]: 759/1423 cut-off events. [2025-04-14 01:35:15,578 INFO L117 PetriNetUnfolderBase]: For 1242/1242 co-relation queries the response was YES. [2025-04-14 01:35:15,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5263 conditions, 1423 events. 759/1423 cut-off events. For 1242/1242 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7651 event pairs, 14 based on Foata normal form. 3/1277 useless extension candidates. Maximal degree in co-relation 5124. Up to 653 conditions per place. [2025-04-14 01:35:15,586 INFO L140 encePairwiseOnDemand]: 11/27 looper letters, 202 selfloop transitions, 212 changer transitions 7/421 dead transitions. [2025-04-14 01:35:15,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 421 transitions, 3295 flow [2025-04-14 01:35:15,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 01:35:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 01:35:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 244 transitions. [2025-04-14 01:35:15,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22592592592592592 [2025-04-14 01:35:15,588 INFO L175 Difference]: Start difference. First operand has 149 places, 286 transitions, 1739 flow. Second operand 40 states and 244 transitions. [2025-04-14 01:35:15,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 421 transitions, 3295 flow [2025-04-14 01:35:15,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 421 transitions, 3218 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-14 01:35:15,602 INFO L231 Difference]: Finished difference. Result has 192 places, 347 transitions, 2923 flow [2025-04-14 01:35:15,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=2923, PETRI_PLACES=192, PETRI_TRANSITIONS=347} [2025-04-14 01:35:15,603 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 167 predicate places. [2025-04-14 01:35:15,603 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 347 transitions, 2923 flow [2025-04-14 01:35:15,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.5833333333333335) internal successors, (129), 36 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:15,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:15,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:15,610 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-14 01:35:15,807 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,SelfDestructingSolverStorable8 [2025-04-14 01:35:15,807 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:15,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash -203020543, now seen corresponding path program 5 times [2025-04-14 01:35:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:15,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676450805] [2025-04-14 01:35:15,808 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:35:15,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:15,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:15,826 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:15,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:15,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:17,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676450805] [2025-04-14 01:35:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676450805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:17,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713893701] [2025-04-14 01:35:17,350 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:35:17,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:17,352 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-14 01:35:17,353 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-14 01:35:17,397 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:17,413 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:17,413 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:17,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:17,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:35:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:17,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:35:17,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:17,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2025-04-14 01:35:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:35:17,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:18,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:18,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 324 [2025-04-14 01:35:19,330 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:19,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2025-04-14 01:35:19,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:19,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-14 01:35:19,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:19,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-14 01:35:19,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:19,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-14 01:35:19,770 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:19,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2025-04-14 01:35:19,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:19,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2025-04-14 01:35:19,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:19,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-14 01:35:19,900 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:35:19,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2025-04-14 01:35:19,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:19,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-14 01:35:19,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:19,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-04-14 01:35:19,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:35:19,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-04-14 01:35:19,951 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:35:19,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 1 [2025-04-14 01:35:19,986 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:19,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 222 [2025-04-14 01:35:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:35:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713893701] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:35:20,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:35:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2025-04-14 01:35:20,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367531999] [2025-04-14 01:35:20,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:35:20,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 01:35:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:20,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 01:35:20,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 01:35:20,373 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:20,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 347 transitions, 2923 flow. Second operand has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:20,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:20,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:20,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:23,704 INFO L116 PetriNetUnfolderBase]: 950/1766 cut-off events. [2025-04-14 01:35:23,704 INFO L117 PetriNetUnfolderBase]: For 2537/2537 co-relation queries the response was YES. [2025-04-14 01:35:23,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 1766 events. 950/1766 cut-off events. For 2537/2537 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10030 event pairs, 3 based on Foata normal form. 4/1593 useless extension candidates. Maximal degree in co-relation 7511. Up to 619 conditions per place. [2025-04-14 01:35:23,716 INFO L140 encePairwiseOnDemand]: 11/27 looper letters, 243 selfloop transitions, 282 changer transitions 11/536 dead transitions. [2025-04-14 01:35:23,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 536 transitions, 5055 flow [2025-04-14 01:35:23,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-14 01:35:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-14 01:35:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 296 transitions. [2025-04-14 01:35:23,717 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24362139917695474 [2025-04-14 01:35:23,717 INFO L175 Difference]: Start difference. First operand has 192 places, 347 transitions, 2923 flow. Second operand 45 states and 296 transitions. [2025-04-14 01:35:23,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 536 transitions, 5055 flow [2025-04-14 01:35:23,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 536 transitions, 4810 flow, removed 33 selfloop flow, removed 22 redundant places. [2025-04-14 01:35:23,747 INFO L231 Difference]: Finished difference. Result has 227 places, 428 transitions, 4356 flow [2025-04-14 01:35:23,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2682, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4356, PETRI_PLACES=227, PETRI_TRANSITIONS=428} [2025-04-14 01:35:23,749 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 202 predicate places. [2025-04-14 01:35:23,749 INFO L485 AbstractCegarLoop]: Abstraction has has 227 places, 428 transitions, 4356 flow [2025-04-14 01:35:23,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:23,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:23,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:23,760 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-14 01:35:23,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:23,951 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:23,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -29772851, now seen corresponding path program 6 times [2025-04-14 01:35:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:23,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276932606] [2025-04-14 01:35:23,951 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:35:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:23,958 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:23,979 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-04-14 01:35:23,979 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:35:23,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:35:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:24,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276932606] [2025-04-14 01:35:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276932606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:35:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498270563] [2025-04-14 01:35:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:24,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:35:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:24,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:35:24,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:35:24,214 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:24,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 428 transitions, 4356 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:24,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:24,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:24,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:24,672 INFO L116 PetriNetUnfolderBase]: 975/1792 cut-off events. [2025-04-14 01:35:24,672 INFO L117 PetriNetUnfolderBase]: For 4003/4003 co-relation queries the response was YES. [2025-04-14 01:35:24,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9021 conditions, 1792 events. 975/1792 cut-off events. For 4003/4003 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9996 event pairs, 43 based on Foata normal form. 1/1654 useless extension candidates. Maximal degree in co-relation 8922. Up to 1440 conditions per place. [2025-04-14 01:35:24,685 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 387 selfloop transitions, 74 changer transitions 2/463 dead transitions. [2025-04-14 01:35:24,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 463 transitions, 5531 flow [2025-04-14 01:35:24,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:35:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:35:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2025-04-14 01:35:24,686 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2025-04-14 01:35:24,686 INFO L175 Difference]: Start difference. First operand has 227 places, 428 transitions, 4356 flow. Second operand 10 states and 84 transitions. [2025-04-14 01:35:24,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 463 transitions, 5531 flow [2025-04-14 01:35:24,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 463 transitions, 5223 flow, removed 47 selfloop flow, removed 28 redundant places. [2025-04-14 01:35:24,731 INFO L231 Difference]: Finished difference. Result has 210 places, 443 transitions, 4442 flow [2025-04-14 01:35:24,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4048, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4442, PETRI_PLACES=210, PETRI_TRANSITIONS=443} [2025-04-14 01:35:24,732 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 185 predicate places. [2025-04-14 01:35:24,733 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 443 transitions, 4442 flow [2025-04-14 01:35:24,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:24,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:24,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:24,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:35:24,733 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:24,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash -888225715, now seen corresponding path program 7 times [2025-04-14 01:35:24,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:24,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284973224] [2025-04-14 01:35:24,733 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:35:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:24,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:35:24,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:24,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:24,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:25,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:25,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284973224] [2025-04-14 01:35:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284973224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:25,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976097560] [2025-04-14 01:35:25,644 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:35:25,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:25,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:25,645 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-14 01:35:25,646 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-14 01:35:25,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:35:25,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:25,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:25,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:25,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:35:25,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:25,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:35:25,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:35:25,810 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:35:25,811 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:35:25,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:35:26,076 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:26,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2025-04-14 01:35:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:26,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:27,080 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:27,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 73 [2025-04-14 01:35:27,155 INFO L325 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2025-04-14 01:35:27,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 182 [2025-04-14 01:35:27,175 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:35:27,201 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:27,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 125 [2025-04-14 01:35:29,576 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:29,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 84 [2025-04-14 01:35:29,658 INFO L325 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-04-14 01:35:29,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 231 [2025-04-14 01:35:29,708 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:29,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 167 [2025-04-14 01:35:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:33,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976097560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:35:33,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:35:33,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-04-14 01:35:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198764046] [2025-04-14 01:35:33,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:35:33,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:35:33,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:33,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:35:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1013, Unknown=2, NotChecked=0, Total=1122 [2025-04-14 01:35:33,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:33,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 443 transitions, 4442 flow. Second operand has 34 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 34 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:33,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:33,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:33,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:40,985 INFO L116 PetriNetUnfolderBase]: 1133/2065 cut-off events. [2025-04-14 01:35:40,986 INFO L117 PetriNetUnfolderBase]: For 4767/4767 co-relation queries the response was YES. [2025-04-14 01:35:40,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10667 conditions, 2065 events. 1133/2065 cut-off events. For 4767/4767 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 11857 event pairs, 45 based on Foata normal form. 2/1906 useless extension candidates. Maximal degree in co-relation 10499. Up to 1551 conditions per place. [2025-04-14 01:35:41,001 INFO L140 encePairwiseOnDemand]: 11/27 looper letters, 442 selfloop transitions, 146 changer transitions 7/595 dead transitions. [2025-04-14 01:35:41,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 595 transitions, 6876 flow [2025-04-14 01:35:41,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:35:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:35:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 269 transitions. [2025-04-14 01:35:41,002 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25546058879392214 [2025-04-14 01:35:41,002 INFO L175 Difference]: Start difference. First operand has 210 places, 443 transitions, 4442 flow. Second operand 39 states and 269 transitions. [2025-04-14 01:35:41,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 595 transitions, 6876 flow [2025-04-14 01:35:41,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 595 transitions, 6730 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-04-14 01:35:41,057 INFO L231 Difference]: Finished difference. Result has 253 places, 514 transitions, 5744 flow [2025-04-14 01:35:41,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4321, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=5744, PETRI_PLACES=253, PETRI_TRANSITIONS=514} [2025-04-14 01:35:41,059 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 228 predicate places. [2025-04-14 01:35:41,059 INFO L485 AbstractCegarLoop]: Abstraction has has 253 places, 514 transitions, 5744 flow [2025-04-14 01:35:41,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 34 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:41,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:41,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:41,065 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-14 01:35:41,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:41,260 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:41,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -998875255, now seen corresponding path program 8 times [2025-04-14 01:35:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:41,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016665023] [2025-04-14 01:35:41,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:41,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:41,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-04-14 01:35:41,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:35:41,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:35:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:41,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016665023] [2025-04-14 01:35:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016665023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:41,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:41,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:35:41,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428042336] [2025-04-14 01:35:41,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:41,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:35:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:41,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:35:41,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:35:41,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:41,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 514 transitions, 5744 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:41,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:41,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:41,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:42,006 INFO L116 PetriNetUnfolderBase]: 1160/2105 cut-off events. [2025-04-14 01:35:42,007 INFO L117 PetriNetUnfolderBase]: For 5996/5996 co-relation queries the response was YES. [2025-04-14 01:35:42,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11460 conditions, 2105 events. 1160/2105 cut-off events. For 5996/5996 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 11994 event pairs, 46 based on Foata normal form. 1/1958 useless extension candidates. Maximal degree in co-relation 11350. Up to 1651 conditions per place. [2025-04-14 01:35:42,022 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 429 selfloop transitions, 119 changer transitions 2/550 dead transitions. [2025-04-14 01:35:42,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 550 transitions, 7140 flow [2025-04-14 01:35:42,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:35:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:35:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2025-04-14 01:35:42,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2025-04-14 01:35:42,023 INFO L175 Difference]: Start difference. First operand has 253 places, 514 transitions, 5744 flow. Second operand 10 states and 86 transitions. [2025-04-14 01:35:42,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 550 transitions, 7140 flow [2025-04-14 01:35:42,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 550 transitions, 6897 flow, removed 101 selfloop flow, removed 14 redundant places. [2025-04-14 01:35:42,091 INFO L231 Difference]: Finished difference. Result has 249 places, 528 transitions, 6049 flow [2025-04-14 01:35:42,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=5521, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6049, PETRI_PLACES=249, PETRI_TRANSITIONS=528} [2025-04-14 01:35:42,092 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 224 predicate places. [2025-04-14 01:35:42,092 INFO L485 AbstractCegarLoop]: Abstraction has has 249 places, 528 transitions, 6049 flow [2025-04-14 01:35:42,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:42,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:42,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:42,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:35:42,092 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:42,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:42,092 INFO L85 PathProgramCache]: Analyzing trace with hash -882863335, now seen corresponding path program 9 times [2025-04-14 01:35:42,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:42,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438252642] [2025-04-14 01:35:42,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:35:42,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:42,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:42,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-04-14 01:35:42,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:35:42,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:35:42,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:42,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438252642] [2025-04-14 01:35:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438252642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:42,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:35:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719663903] [2025-04-14 01:35:42,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:42,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:35:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:42,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:35:42,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:35:42,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:42,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 528 transitions, 6049 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:42,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:42,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:42,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:42,853 INFO L116 PetriNetUnfolderBase]: 1197/2174 cut-off events. [2025-04-14 01:35:42,854 INFO L117 PetriNetUnfolderBase]: For 6625/6625 co-relation queries the response was YES. [2025-04-14 01:35:42,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12055 conditions, 2174 events. 1197/2174 cut-off events. For 6625/6625 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 12505 event pairs, 51 based on Foata normal form. 1/2028 useless extension candidates. Maximal degree in co-relation 11841. Up to 1661 conditions per place. [2025-04-14 01:35:42,866 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 412 selfloop transitions, 147 changer transitions 1/560 dead transitions. [2025-04-14 01:35:42,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 560 transitions, 7419 flow [2025-04-14 01:35:42,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:35:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:35:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2025-04-14 01:35:42,867 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2025-04-14 01:35:42,867 INFO L175 Difference]: Start difference. First operand has 249 places, 528 transitions, 6049 flow. Second operand 10 states and 83 transitions. [2025-04-14 01:35:42,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 560 transitions, 7419 flow [2025-04-14 01:35:42,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 560 transitions, 7307 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-04-14 01:35:42,935 INFO L231 Difference]: Finished difference. Result has 256 places, 542 transitions, 6525 flow [2025-04-14 01:35:42,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=5937, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6525, PETRI_PLACES=256, PETRI_TRANSITIONS=542} [2025-04-14 01:35:42,936 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 231 predicate places. [2025-04-14 01:35:42,936 INFO L485 AbstractCegarLoop]: Abstraction has has 256 places, 542 transitions, 6525 flow [2025-04-14 01:35:42,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:35:42,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:42,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:42,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 01:35:42,936 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:42,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash -24583451, now seen corresponding path program 10 times [2025-04-14 01:35:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:42,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251675740] [2025-04-14 01:35:42,937 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:42,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:42,943 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:42,953 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:42,953 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:42,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:44,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251675740] [2025-04-14 01:35:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251675740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:44,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371214413] [2025-04-14 01:35:44,469 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:44,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:44,470 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-14 01:35:44,471 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-14 01:35:44,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:35:44,529 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:35:44,529 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:44,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:44,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-14 01:35:44,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:44,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:35:44,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:35:44,668 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:35:44,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:35:44,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:35:45,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-04-14 01:35:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:45,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:48,846 INFO L325 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-04-14 01:35:48,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 298 [2025-04-14 01:35:48,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:48,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 223 [2025-04-14 01:35:48,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-04-14 01:35:49,063 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:49,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 184 [2025-04-14 01:35:50,886 INFO L325 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-04-14 01:35:50,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 733 treesize of output 643 [2025-04-14 01:35:50,919 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:50,920 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 426 [2025-04-14 01:35:51,557 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:35:51,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2025-04-14 01:35:51,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-04-14 01:35:51,606 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:35:51,624 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:51,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 73 [2025-04-14 01:35:51,712 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:51,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 469 treesize of output 421 [2025-04-14 01:35:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371214413] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:35:53,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:35:53,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-14 01:35:53,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658758349] [2025-04-14 01:35:53,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:35:53,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:35:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:53,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:35:53,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:35:53,700 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:35:53,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 542 transitions, 6525 flow. Second operand has 37 states, 37 states have (on average 3.5405405405405403) internal successors, (131), 37 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:53,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:53,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:35:53,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:31,082 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:35,135 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:48,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 01:36:52,752 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 01:36:56,151 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 01:37:36,029 INFO L116 PetriNetUnfolderBase]: 1339/2411 cut-off events. [2025-04-14 01:37:36,029 INFO L117 PetriNetUnfolderBase]: For 9010/9010 co-relation queries the response was YES. [2025-04-14 01:37:36,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14166 conditions, 2411 events. 1339/2411 cut-off events. For 9010/9010 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14196 event pairs, 33 based on Foata normal form. 10/2262 useless extension candidates. Maximal degree in co-relation 13938. Up to 1115 conditions per place. [2025-04-14 01:37:36,050 INFO L140 encePairwiseOnDemand]: 11/27 looper letters, 351 selfloop transitions, 340 changer transitions 7/698 dead transitions. [2025-04-14 01:37:36,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 698 transitions, 9413 flow [2025-04-14 01:37:36,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:37:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-14 01:37:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 294 transitions. [2025-04-14 01:37:36,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2474747474747475 [2025-04-14 01:37:36,055 INFO L175 Difference]: Start difference. First operand has 256 places, 542 transitions, 6525 flow. Second operand 44 states and 294 transitions. [2025-04-14 01:37:36,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 698 transitions, 9413 flow [2025-04-14 01:37:36,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 698 transitions, 9278 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-04-14 01:37:36,161 INFO L231 Difference]: Finished difference. Result has 305 places, 613 transitions, 8391 flow [2025-04-14 01:37:36,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=6398, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=8391, PETRI_PLACES=305, PETRI_TRANSITIONS=613} [2025-04-14 01:37:36,161 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 280 predicate places. [2025-04-14 01:37:36,162 INFO L485 AbstractCegarLoop]: Abstraction has has 305 places, 613 transitions, 8391 flow [2025-04-14 01:37:36,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5405405405405403) internal successors, (131), 37 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:36,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:36,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:36,168 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-14 01:37:36,362 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,SelfDestructingSolverStorable14 [2025-04-14 01:37:36,362 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:37:36,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash 197061589, now seen corresponding path program 11 times [2025-04-14 01:37:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:36,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363696758] [2025-04-14 01:37:36,363 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:37:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:36,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:37:36,392 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:37:36,392 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:36,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:43,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363696758] [2025-04-14 01:37:43,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363696758] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:43,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105053357] [2025-04-14 01:37:43,617 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:37:43,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:43,619 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-14 01:37:43,620 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-14 01:37:43,664 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:37:43,681 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:37:43,681 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:43,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:43,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-14 01:37:43,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:43,716 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:37:44,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:37:45,476 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:37:45,476 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:37:46,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:37:53,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-04-14 01:37:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:55,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:10,528 INFO L325 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-04-14 01:38:10,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 298 [2025-04-14 01:38:10,681 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:38:10,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 223 [2025-04-14 01:38:11,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-04-14 01:38:13,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:38:13,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 269 treesize of output 287 [2025-04-14 01:38:20,518 INFO L325 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-04-14 01:38:20,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 461 treesize of output 435 [2025-04-14 01:38:20,678 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:38:20,678 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 346 [2025-04-14 01:38:21,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2025-04-14 01:38:23,037 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:38:23,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 332 treesize of output 320 [2025-04-14 01:38:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:38:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105053357] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:32,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-14 01:38:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957712507] [2025-04-14 01:38:32,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:32,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:38:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:32,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:38:32,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:38:32,777 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:38:32,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 613 transitions, 8391 flow. Second operand has 37 states, 37 states have (on average 3.5405405405405403) internal successors, (131), 37 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:38:32,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:32,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:38:32,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:38:50,161 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:53,216 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:03,840 INFO L116 PetriNetUnfolderBase]: 1459/2614 cut-off events. [2025-04-14 01:41:03,840 INFO L117 PetriNetUnfolderBase]: For 13581/13581 co-relation queries the response was YES. [2025-04-14 01:41:03,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16786 conditions, 2614 events. 1459/2614 cut-off events. For 13581/13581 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 15602 event pairs, 43 based on Foata normal form. 3/2465 useless extension candidates. Maximal degree in co-relation 16642. Up to 1150 conditions per place. [2025-04-14 01:41:03,855 INFO L140 encePairwiseOnDemand]: 11/27 looper letters, 391 selfloop transitions, 404 changer transitions 5/800 dead transitions. [2025-04-14 01:41:03,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 800 transitions, 11455 flow [2025-04-14 01:41:03,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 01:41:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-14 01:41:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 429 transitions. [2025-04-14 01:41:03,857 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24444444444444444 [2025-04-14 01:41:03,857 INFO L175 Difference]: Start difference. First operand has 305 places, 613 transitions, 8391 flow. Second operand 65 states and 429 transitions. [2025-04-14 01:41:03,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 800 transitions, 11455 flow [2025-04-14 01:41:03,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 800 transitions, 10898 flow, removed 235 selfloop flow, removed 23 redundant places. [2025-04-14 01:41:04,006 INFO L231 Difference]: Finished difference. Result has 355 places, 667 transitions, 10015 flow [2025-04-14 01:41:04,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=7958, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=10015, PETRI_PLACES=355, PETRI_TRANSITIONS=667} [2025-04-14 01:41:04,007 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 330 predicate places. [2025-04-14 01:41:04,007 INFO L485 AbstractCegarLoop]: Abstraction has has 355 places, 667 transitions, 10015 flow [2025-04-14 01:41:04,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5405405405405403) internal successors, (131), 37 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:41:04,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:04,008 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:04,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:41:04,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:41:04,208 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:41:04,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1129528274, now seen corresponding path program 12 times [2025-04-14 01:41:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:04,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568274079] [2025-04-14 01:41:04,209 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:41:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:04,215 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:41:04,222 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-04-14 01:41:04,222 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:41:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:41:06,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:06,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568274079] [2025-04-14 01:41:06,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568274079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:06,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:06,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:41:06,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68031321] [2025-04-14 01:41:06,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:06,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:41:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:06,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:41:06,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:41:06,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:41:06,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 667 transitions, 10015 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:41:06,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:06,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:41:06,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:11,427 INFO L116 PetriNetUnfolderBase]: 1482/2660 cut-off events. [2025-04-14 01:41:11,428 INFO L117 PetriNetUnfolderBase]: For 16693/16693 co-relation queries the response was YES. [2025-04-14 01:41:11,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18087 conditions, 2660 events. 1482/2660 cut-off events. For 16693/16693 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 15958 event pairs, 39 based on Foata normal form. 1/2511 useless extension candidates. Maximal degree in co-relation 17914. Up to 2205 conditions per place. [2025-04-14 01:41:11,444 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 578 selfloop transitions, 115 changer transitions 2/695 dead transitions. [2025-04-14 01:41:11,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 695 transitions, 11658 flow [2025-04-14 01:41:11,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:41:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:41:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2025-04-14 01:41:11,445 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2025-04-14 01:41:11,445 INFO L175 Difference]: Start difference. First operand has 355 places, 667 transitions, 10015 flow. Second operand 10 states and 84 transitions. [2025-04-14 01:41:11,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 695 transitions, 11658 flow [2025-04-14 01:41:11,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 695 transitions, 11226 flow, removed 112 selfloop flow, removed 39 redundant places. [2025-04-14 01:41:11,671 INFO L231 Difference]: Finished difference. Result has 327 places, 675 transitions, 10032 flow [2025-04-14 01:41:11,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=9583, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10032, PETRI_PLACES=327, PETRI_TRANSITIONS=675} [2025-04-14 01:41:11,672 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 302 predicate places. [2025-04-14 01:41:11,672 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 675 transitions, 10032 flow [2025-04-14 01:41:11,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:41:11,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:11,672 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:11,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:41:11,672 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:41:11,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash -198911310, now seen corresponding path program 13 times [2025-04-14 01:41:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:11,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331175249] [2025-04-14 01:41:11,673 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:41:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:11,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:41:11,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:41:11,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:11,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:41:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:25,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331175249] [2025-04-14 01:41:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331175249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:25,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069774649] [2025-04-14 01:41:25,905 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:41:25,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:25,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:25,907 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-14 01:41:25,908 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-14 01:41:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:41:25,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:41:25,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:25,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:25,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 01:41:25,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:32,365 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-14 01:41:32,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2025-04-14 01:41:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:41:33,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:40,519 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:41:40,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 275 [2025-04-14 01:42:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:42:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069774649] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:40,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:42:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 9] total 30 [2025-04-14 01:42:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562583024] [2025-04-14 01:42:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:42:40,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:42:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:40,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:42:40,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:42:40,170 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:42:40,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 675 transitions, 10032 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:42:40,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:40,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:42:40,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:47,670 INFO L116 PetriNetUnfolderBase]: 1488/2676 cut-off events. [2025-04-14 01:42:47,670 INFO L117 PetriNetUnfolderBase]: For 15909/15909 co-relation queries the response was YES. [2025-04-14 01:42:47,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18037 conditions, 2676 events. 1488/2676 cut-off events. For 15909/15909 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16095 event pairs, 50 based on Foata normal form. 1/2535 useless extension candidates. Maximal degree in co-relation 17849. Up to 2284 conditions per place. [2025-04-14 01:42:47,702 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 613 selfloop transitions, 81 changer transitions 3/697 dead transitions. [2025-04-14 01:42:47,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 697 transitions, 11563 flow [2025-04-14 01:42:47,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:42:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:42:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2025-04-14 01:42:47,704 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2851851851851852 [2025-04-14 01:42:47,704 INFO L175 Difference]: Start difference. First operand has 327 places, 675 transitions, 10032 flow. Second operand 10 states and 77 transitions. [2025-04-14 01:42:47,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 697 transitions, 11563 flow [2025-04-14 01:42:47,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 697 transitions, 11344 flow, removed 38 selfloop flow, removed 6 redundant places. [2025-04-14 01:42:47,961 INFO L231 Difference]: Finished difference. Result has 333 places, 678 transitions, 10088 flow [2025-04-14 01:42:47,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=9821, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10088, PETRI_PLACES=333, PETRI_TRANSITIONS=678} [2025-04-14 01:42:47,962 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 308 predicate places. [2025-04-14 01:42:47,962 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 678 transitions, 10088 flow [2025-04-14 01:42:47,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:42:47,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:47,963 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:47,970 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-14 01:42:48,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:48,164 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:48,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 78009062, now seen corresponding path program 14 times [2025-04-14 01:42:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:48,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265082685] [2025-04-14 01:42:48,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:48,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:42:48,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-04-14 01:42:48,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:42:48,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:42:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:50,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265082685] [2025-04-14 01:42:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265082685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:42:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:42:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:42:50,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647577443] [2025-04-14 01:42:50,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:42:50,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:42:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:50,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:42:50,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:42:50,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:42:50,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 678 transitions, 10088 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:42:50,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:50,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:42:50,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:55,921 INFO L116 PetriNetUnfolderBase]: 1505/2709 cut-off events. [2025-04-14 01:42:55,922 INFO L117 PetriNetUnfolderBase]: For 16321/16321 co-relation queries the response was YES. [2025-04-14 01:42:55,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18371 conditions, 2709 events. 1505/2709 cut-off events. For 16321/16321 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 16397 event pairs, 53 based on Foata normal form. 1/2570 useless extension candidates. Maximal degree in co-relation 18162. Up to 2249 conditions per place. [2025-04-14 01:42:55,938 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 571 selfloop transitions, 130 changer transitions 2/703 dead transitions. [2025-04-14 01:42:55,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 703 transitions, 11705 flow [2025-04-14 01:42:55,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:42:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:42:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2025-04-14 01:42:55,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2025-04-14 01:42:55,943 INFO L175 Difference]: Start difference. First operand has 333 places, 678 transitions, 10088 flow. Second operand 10 states and 84 transitions. [2025-04-14 01:42:55,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 703 transitions, 11705 flow [2025-04-14 01:42:56,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 703 transitions, 11528 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-14 01:42:56,254 INFO L231 Difference]: Finished difference. Result has 336 places, 684 transitions, 10355 flow [2025-04-14 01:42:56,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=9911, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10355, PETRI_PLACES=336, PETRI_TRANSITIONS=684} [2025-04-14 01:42:56,257 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 311 predicate places. [2025-04-14 01:42:56,257 INFO L485 AbstractCegarLoop]: Abstraction has has 336 places, 684 transitions, 10355 flow [2025-04-14 01:42:56,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:42:56,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:56,257 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:56,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 01:42:56,258 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:56,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 941478346, now seen corresponding path program 15 times [2025-04-14 01:42:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:56,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716691871] [2025-04-14 01:42:56,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:56,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:42:56,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-04-14 01:42:56,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:42:56,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:42:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:58,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716691871] [2025-04-14 01:42:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716691871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:42:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:42:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:42:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292529483] [2025-04-14 01:42:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:42:58,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:42:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:58,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:42:58,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:42:58,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:42:58,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 684 transitions, 10355 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:42:58,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:58,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:42:58,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:04,003 INFO L116 PetriNetUnfolderBase]: 1534/2766 cut-off events. [2025-04-14 01:43:04,003 INFO L117 PetriNetUnfolderBase]: For 18296/18296 co-relation queries the response was YES. [2025-04-14 01:43:04,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18985 conditions, 2766 events. 1534/2766 cut-off events. For 18296/18296 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 16807 event pairs, 60 based on Foata normal form. 1/2634 useless extension candidates. Maximal degree in co-relation 18806. Up to 2275 conditions per place. [2025-04-14 01:43:04,023 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 574 selfloop transitions, 141 changer transitions 2/717 dead transitions. [2025-04-14 01:43:04,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 717 transitions, 12108 flow [2025-04-14 01:43:04,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:43:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:43:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2025-04-14 01:43:04,024 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2025-04-14 01:43:04,024 INFO L175 Difference]: Start difference. First operand has 336 places, 684 transitions, 10355 flow. Second operand 10 states and 83 transitions. [2025-04-14 01:43:04,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 717 transitions, 12108 flow [2025-04-14 01:43:04,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 717 transitions, 11886 flow, removed 26 selfloop flow, removed 6 redundant places. [2025-04-14 01:43:04,242 INFO L231 Difference]: Finished difference. Result has 341 places, 697 transitions, 10743 flow [2025-04-14 01:43:04,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=10133, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10743, PETRI_PLACES=341, PETRI_TRANSITIONS=697} [2025-04-14 01:43:04,243 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 316 predicate places. [2025-04-14 01:43:04,243 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 697 transitions, 10743 flow [2025-04-14 01:43:04,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:43:04,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:04,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:04,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 01:43:04,243 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:04,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1163123386, now seen corresponding path program 16 times [2025-04-14 01:43:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:04,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548352246] [2025-04-14 01:43:04,244 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:43:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:04,250 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:43:04,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:43:04,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:43:04,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:43:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:06,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548352246] [2025-04-14 01:43:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548352246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:43:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:43:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:43:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377379652] [2025-04-14 01:43:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:43:06,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:43:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:06,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:43:06,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:43:06,408 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:43:06,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 697 transitions, 10743 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:43:06,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:06,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:43:06,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:12,388 INFO L116 PetriNetUnfolderBase]: 1564/2820 cut-off events. [2025-04-14 01:43:12,388 INFO L117 PetriNetUnfolderBase]: For 19206/19206 co-relation queries the response was YES. [2025-04-14 01:43:12,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19671 conditions, 2820 events. 1564/2820 cut-off events. For 19206/19206 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 17225 event pairs, 65 based on Foata normal form. 1/2688 useless extension candidates. Maximal degree in co-relation 19433. Up to 2330 conditions per place. [2025-04-14 01:43:12,408 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 614 selfloop transitions, 112 changer transitions 1/727 dead transitions. [2025-04-14 01:43:12,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 727 transitions, 12474 flow [2025-04-14 01:43:12,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:43:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:43:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2025-04-14 01:43:12,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27946127946127947 [2025-04-14 01:43:12,409 INFO L175 Difference]: Start difference. First operand has 341 places, 697 transitions, 10743 flow. Second operand 11 states and 83 transitions. [2025-04-14 01:43:12,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 727 transitions, 12474 flow [2025-04-14 01:43:12,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 727 transitions, 12228 flow, removed 31 selfloop flow, removed 7 redundant places. [2025-04-14 01:43:12,612 INFO L231 Difference]: Finished difference. Result has 346 places, 707 transitions, 11010 flow [2025-04-14 01:43:12,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=10503, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11010, PETRI_PLACES=346, PETRI_TRANSITIONS=707} [2025-04-14 01:43:12,614 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 321 predicate places. [2025-04-14 01:43:12,615 INFO L485 AbstractCegarLoop]: Abstraction has has 346 places, 707 transitions, 11010 flow [2025-04-14 01:43:12,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-14 01:43:12,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:12,615 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:12,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 01:43:12,616 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:12,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1773991233, now seen corresponding path program 1 times [2025-04-14 01:43:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:12,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492778034] [2025-04-14 01:43:12,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:43:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:12,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:43:12,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:43:12,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:43:12,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:43:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:13,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492778034] [2025-04-14 01:43:13,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492778034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:13,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306638178] [2025-04-14 01:43:13,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:43:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:13,280 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-14 01:43:13,280 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-14 01:43:13,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:43:13,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:43:13,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:43:13,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:13,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:43:13,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:43:14,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:43:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:43:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306638178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:43:15,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:43:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:43:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765646354] [2025-04-14 01:43:15,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:43:15,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:43:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:15,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:43:15,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:43:15,697 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:43:15,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 707 transitions, 11010 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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-14 01:43:15,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:15,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:43:15,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:18,944 INFO L116 PetriNetUnfolderBase]: 1311/2543 cut-off events. [2025-04-14 01:43:18,944 INFO L117 PetriNetUnfolderBase]: For 19885/19885 co-relation queries the response was YES. [2025-04-14 01:43:18,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18369 conditions, 2543 events. 1311/2543 cut-off events. For 19885/19885 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 16472 event pairs, 339 based on Foata normal form. 168/2567 useless extension candidates. Maximal degree in co-relation 18289. Up to 1266 conditions per place. [2025-04-14 01:43:18,961 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 505 selfloop transitions, 11 changer transitions 107/623 dead transitions. [2025-04-14 01:43:18,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 623 transitions, 11050 flow [2025-04-14 01:43:18,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:43:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:43:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-04-14 01:43:18,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-04-14 01:43:18,962 INFO L175 Difference]: Start difference. First operand has 346 places, 707 transitions, 11010 flow. Second operand 6 states and 60 transitions. [2025-04-14 01:43:18,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 623 transitions, 11050 flow [2025-04-14 01:43:19,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 623 transitions, 10555 flow, removed 81 selfloop flow, removed 14 redundant places. [2025-04-14 01:43:19,163 INFO L231 Difference]: Finished difference. Result has 313 places, 449 transitions, 6784 flow [2025-04-14 01:43:19,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=8078, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6784, PETRI_PLACES=313, PETRI_TRANSITIONS=449} [2025-04-14 01:43:19,164 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 288 predicate places. [2025-04-14 01:43:19,164 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 449 transitions, 6784 flow [2025-04-14 01:43:19,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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-14 01:43:19,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:19,165 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:19,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:43:19,365 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,SelfDestructingSolverStorable21 [2025-04-14 01:43:19,365 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:19,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash -366277925, now seen corresponding path program 1 times [2025-04-14 01:43:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:19,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613321423] [2025-04-14 01:43:19,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:43:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:19,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:43:19,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:43:19,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:43:19,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:43:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:19,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613321423] [2025-04-14 01:43:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613321423] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:19,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240665150] [2025-04-14 01:43:19,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:43:19,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:19,938 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:43:19,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:43:19,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:43:20,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:43:20,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:43:20,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:20,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:43:20,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:43:21,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:43:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:43:22,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240665150] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:43:22,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:43:22,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:43:22,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507094387] [2025-04-14 01:43:22,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:43:22,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:43:22,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:22,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:43:22,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:43:22,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:43:22,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 449 transitions, 6784 flow. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:22,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:22,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:43:22,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:25,622 INFO L116 PetriNetUnfolderBase]: 1268/2457 cut-off events. [2025-04-14 01:43:25,622 INFO L117 PetriNetUnfolderBase]: For 20492/20492 co-relation queries the response was YES. [2025-04-14 01:43:25,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18016 conditions, 2457 events. 1268/2457 cut-off events. For 20492/20492 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15606 event pairs, 355 based on Foata normal form. 78/2407 useless extension candidates. Maximal degree in co-relation 17940. Up to 1334 conditions per place. [2025-04-14 01:43:25,640 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 356 selfloop transitions, 19 changer transitions 111/486 dead transitions. [2025-04-14 01:43:25,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 486 transitions, 8695 flow [2025-04-14 01:43:25,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:43:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:43:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-04-14 01:43:25,641 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-04-14 01:43:25,641 INFO L175 Difference]: Start difference. First operand has 313 places, 449 transitions, 6784 flow. Second operand 6 states and 60 transitions. [2025-04-14 01:43:25,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 486 transitions, 8695 flow [2025-04-14 01:43:25,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 486 transitions, 8276 flow, removed 37 selfloop flow, removed 13 redundant places. [2025-04-14 01:43:25,809 INFO L231 Difference]: Finished difference. Result has 264 places, 303 transitions, 4681 flow [2025-04-14 01:43:25,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=5765, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4681, PETRI_PLACES=264, PETRI_TRANSITIONS=303} [2025-04-14 01:43:25,810 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 239 predicate places. [2025-04-14 01:43:25,810 INFO L485 AbstractCegarLoop]: Abstraction has has 264 places, 303 transitions, 4681 flow [2025-04-14 01:43:25,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:25,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:25,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:25,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 01:43:26,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:26,011 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:26,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1463718471, now seen corresponding path program 2 times [2025-04-14 01:43:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:26,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74434442] [2025-04-14 01:43:26,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:43:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:26,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:43:26,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:43:26,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:43:26,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:43:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:26,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74434442] [2025-04-14 01:43:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74434442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:26,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307551515] [2025-04-14 01:43:26,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:43:26,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:26,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:26,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:43:26,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:43:26,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:43:26,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:43:26,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:43:26,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:26,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 01:43:26,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:27,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:43:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307551515] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:43:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:43:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-14 01:43:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946300696] [2025-04-14 01:43:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:43:27,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:43:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:27,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:43:27,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:43:27,599 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:43:27,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 303 transitions, 4681 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:27,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:27,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:43:27,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:28,655 INFO L116 PetriNetUnfolderBase]: 1276/2534 cut-off events. [2025-04-14 01:43:28,655 INFO L117 PetriNetUnfolderBase]: For 20419/20419 co-relation queries the response was YES. [2025-04-14 01:43:28,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18267 conditions, 2534 events. 1276/2534 cut-off events. For 20419/20419 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16397 event pairs, 345 based on Foata normal form. 82/2458 useless extension candidates. Maximal degree in co-relation 18197. Up to 1243 conditions per place. [2025-04-14 01:43:28,671 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 269 selfloop transitions, 32 changer transitions 67/368 dead transitions. [2025-04-14 01:43:28,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 368 transitions, 6431 flow [2025-04-14 01:43:28,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:43:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:43:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-14 01:43:28,672 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-04-14 01:43:28,672 INFO L175 Difference]: Start difference. First operand has 264 places, 303 transitions, 4681 flow. Second operand 4 states and 55 transitions. [2025-04-14 01:43:28,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 368 transitions, 6431 flow [2025-04-14 01:43:28,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 368 transitions, 6271 flow, removed 30 selfloop flow, removed 12 redundant places. [2025-04-14 01:43:28,777 INFO L231 Difference]: Finished difference. Result has 223 places, 232 transitions, 3620 flow [2025-04-14 01:43:28,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4373, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3620, PETRI_PLACES=223, PETRI_TRANSITIONS=232} [2025-04-14 01:43:28,778 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 198 predicate places. [2025-04-14 01:43:28,778 INFO L485 AbstractCegarLoop]: Abstraction has has 223 places, 232 transitions, 3620 flow [2025-04-14 01:43:28,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:28,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:28,778 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:28,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:43:28,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-14 01:43:28,980 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:28,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash 827392678, now seen corresponding path program 2 times [2025-04-14 01:43:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:28,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718609813] [2025-04-14 01:43:28,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:43:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:28,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:43:28,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:43:28,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:43:28,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:29,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:29,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718609813] [2025-04-14 01:43:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718609813] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:43:29,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:43:29,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:43:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945741373] [2025-04-14 01:43:29,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:43:29,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:43:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:29,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:43:29,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:43:29,310 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:43:29,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 232 transitions, 3620 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:29,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:29,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:43:29,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:30,266 INFO L116 PetriNetUnfolderBase]: 923/1831 cut-off events. [2025-04-14 01:43:30,267 INFO L117 PetriNetUnfolderBase]: For 20920/20920 co-relation queries the response was YES. [2025-04-14 01:43:30,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14128 conditions, 1831 events. 923/1831 cut-off events. For 20920/20920 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10092 event pairs, 261 based on Foata normal form. 140/1824 useless extension candidates. Maximal degree in co-relation 14062. Up to 975 conditions per place. [2025-04-14 01:43:30,276 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 150 selfloop transitions, 18 changer transitions 70/238 dead transitions. [2025-04-14 01:43:30,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 238 transitions, 4178 flow [2025-04-14 01:43:30,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:43:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:43:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 01:43:30,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-04-14 01:43:30,277 INFO L175 Difference]: Start difference. First operand has 223 places, 232 transitions, 3620 flow. Second operand 4 states and 57 transitions. [2025-04-14 01:43:30,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 238 transitions, 4178 flow [2025-04-14 01:43:30,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 238 transitions, 3754 flow, removed 106 selfloop flow, removed 31 redundant places. [2025-04-14 01:43:30,324 INFO L231 Difference]: Finished difference. Result has 161 places, 115 transitions, 1592 flow [2025-04-14 01:43:30,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2411, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1592, PETRI_PLACES=161, PETRI_TRANSITIONS=115} [2025-04-14 01:43:30,325 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 136 predicate places. [2025-04-14 01:43:30,325 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 115 transitions, 1592 flow [2025-04-14 01:43:30,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:30,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:30,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:30,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 01:43:30,325 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:30,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1746589466, now seen corresponding path program 1 times [2025-04-14 01:43:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:30,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327902798] [2025-04-14 01:43:30,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:43:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:30,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:43:30,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:43:30,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:43:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:43:41,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:41,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327902798] [2025-04-14 01:43:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327902798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:41,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238037075] [2025-04-14 01:43:41,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:43:41,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:41,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:41,497 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:43:41,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:43:41,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:43:41,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:43:41,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:43:41,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:41,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-14 01:43:41,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:41,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:43:43,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:43:44,255 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:43:44,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:43:45,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:43:46,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:44:01,938 INFO L325 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-04-14 01:44:01,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 25 [2025-04-14 01:44:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:02,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:41,143 INFO L325 Elim1Store]: treesize reduction 188, result has 54.7 percent of original size [2025-04-14 01:44:41,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 532 treesize of output 627 Received shutdown request... [2025-04-14 01:48:30,914 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:48:30,946 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:48:30,981 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:48:30,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:48:31,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 01:48:31,182 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-21-2-1 context. [2025-04-14 01:48:31,184 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:48:31,185 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:48:31,185 INFO L422 BasicCegarLoop]: Path program histogram: [16, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-14 01:48:31,190 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:48:31,190 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:48:31,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:48:31 BasicIcfg [2025-04-14 01:48:31,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:48:31,210 INFO L158 Benchmark]: Toolchain (without parser) took 843065.81ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 107.2MB in the beginning and 135.6MB in the end (delta: -28.4MB). Peak memory consumption was 179.5MB. Max. memory is 8.0GB. [2025-04-14 01:48:31,210 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:48:31,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.74ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 92.3MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:48:31,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.89ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 89.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:48:31,211 INFO L158 Benchmark]: Boogie Preprocessor took 32.11ms. Allocated memory is still 155.2MB. Free memory was 89.8MB in the beginning and 88.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:48:31,211 INFO L158 Benchmark]: IcfgBuilder took 655.41ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 92.4MB in the end (delta: -4.2MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2025-04-14 01:48:31,211 INFO L158 Benchmark]: TraceAbstraction took 842037.55ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 91.6MB in the beginning and 135.6MB in the end (delta: -44.1MB). Peak memory consumption was 163.7MB. Max. memory is 8.0GB. [2025-04-14 01:48:31,213 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.74ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 92.3MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.89ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 89.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.11ms. Allocated memory is still 155.2MB. Free memory was 89.8MB in the beginning and 88.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 655.41ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 92.4MB in the end (delta: -4.2MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 842037.55ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 91.6MB in the beginning and 135.6MB in the end (delta: -44.1MB). Peak memory consumption was 163.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-21-2-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-21-2-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-21-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 43 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 841.9s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 336.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 1966 SdHoareTripleChecker+Valid, 119.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1966 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 113.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 753 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14019 IncrementalHoareTripleChecker+Invalid, 14783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 753 mSolverCounterUnsat, 0 mSDtfsCounter, 14019 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 895 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 647 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9445 ImplicationChecksByTransitivity, 274.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11010occurred in iteration=21, InterpolantAutomatonStates: 463, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 201.1s InterpolantComputationTime, 714 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 858 ConstructedInterpolants, 56 QuantifiedInterpolants, 23608 SizeOfPredicates, 141 NumberOfNonLiveVariables, 2053 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 44 InterpolantComputations, 17 PerfectInterpolantSequences, 76/125 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown