/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/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:36:58,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:36:58,622 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:36:58,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:36:58,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:36:58,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:36:58,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:36:58,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:36:58,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:36:58,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:36:58,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:36:58,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:36:58,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:36:58,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:36:58,648 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:36:58,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:58,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:58,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:36:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:36:58,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:36:58,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:36:58,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:36:58,650 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:36:58,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:36:58,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:36:58,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:36:58,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:36:58,913 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:36:58,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2025-04-14 01:37:00,267 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f37bc258/842579233701447d9fc30aa92214d584/FLAGd14031fec [2025-04-14 01:37:00,459 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:37:00,459 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2025-04-14 01:37:00,466 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f37bc258/842579233701447d9fc30aa92214d584/FLAGd14031fec [2025-04-14 01:37:01,318 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f37bc258/842579233701447d9fc30aa92214d584 [2025-04-14 01:37:01,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:37:01,323 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:37:01,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:37:01,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:37:01,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:37:01,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1878e6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01, skipping insertion in model container [2025-04-14 01:37:01,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:37:01,480 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/unroll-2.wvr.c[2454,2467] [2025-04-14 01:37:01,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:37:01,492 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:37:01,515 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/unroll-2.wvr.c[2454,2467] [2025-04-14 01:37:01,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:37:01,531 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:37:01,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01 WrapperNode [2025-04-14 01:37:01,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:37:01,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:37:01,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:37:01,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:37:01,537 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:37:01" (1/1) ... [2025-04-14 01:37:01,548 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:37:01" (1/1) ... [2025-04-14 01:37:01,568 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 118 [2025-04-14 01:37:01,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:37:01,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:37:01,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:37:01,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:37:01,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,591 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 01:37:01,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:37:01,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:37:01,601 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:37:01,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:37:01,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (1/1) ... [2025-04-14 01:37:01,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:37:01,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:01,629 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:37:01,632 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:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:37:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:37:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:37:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:37:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:37:01,649 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:37:01,726 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:37:01,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:37:01,946 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:37:01,947 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:37:01,947 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:37:02,133 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:37:02,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:37:02 BoogieIcfgContainer [2025-04-14 01:37:02,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:37:02,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:37:02,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:37:02,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:37:02,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:37:01" (1/3) ... [2025-04-14 01:37:02,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc0f1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:37:02, skipping insertion in model container [2025-04-14 01:37:02,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:37:01" (2/3) ... [2025-04-14 01:37:02,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc0f1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:37:02, skipping insertion in model container [2025-04-14 01:37:02,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:37:02" (3/3) ... [2025-04-14 01:37:02,142 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2025-04-14 01:37:02,152 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:37:02,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-2.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 01:37:02,154 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:37:02,191 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:37:02,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-14 01:37:02,239 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-14 01:37:02,241 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:37:02,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 3/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-14 01:37:02,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-14 01:37:02,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-14 01:37:02,252 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:37:02,260 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;@42fe73f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:37:02,261 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:37:02,266 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:37:02,266 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-14 01:37:02,266 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:37:02,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:02,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:02,268 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:37:02,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2038387280, now seen corresponding path program 1 times [2025-04-14 01:37:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:02,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947859918] [2025-04-14 01:37:02,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:02,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:37:02,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:37:02,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:02,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:02,498 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:37:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:02,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947859918] [2025-04-14 01:37:02,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947859918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:02,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:02,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:37:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351297622] [2025-04-14 01:37:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:02,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:37:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:02,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:37:02,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:37:02,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:02,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:02,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:02,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:02,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:02,623 INFO L116 PetriNetUnfolderBase]: 69/124 cut-off events. [2025-04-14 01:37:02,623 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-14 01:37:02,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 124 events. 69/124 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 315 event pairs, 22 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-04-14 01:37:02,628 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-14 01:37:02,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 27 transitions, 129 flow [2025-04-14 01:37:02,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:37:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:37:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-14 01:37:02,639 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-14 01:37:02,640 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 34 transitions. [2025-04-14 01:37:02,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 27 transitions, 129 flow [2025-04-14 01:37:02,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:37:02,649 INFO L231 Difference]: Finished difference. Result has 19 places, 18 transitions, 55 flow [2025-04-14 01:37:02,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=19, PETRI_TRANSITIONS=18} [2025-04-14 01:37:02,655 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-14 01:37:02,656 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 18 transitions, 55 flow [2025-04-14 01:37:02,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:02,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:02,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:02,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:37:02,656 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:37:02,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1311802930, now seen corresponding path program 1 times [2025-04-14 01:37:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:02,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272033082] [2025-04-14 01:37:02,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:02,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:37:02,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:37:02,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:02,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:02,835 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:37:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:02,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272033082] [2025-04-14 01:37:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272033082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:37:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140556557] [2025-04-14 01:37:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:02,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:37:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:02,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:37:02,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:37:02,837 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:02,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:02,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:02,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:02,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:02,896 INFO L116 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-04-14 01:37:02,897 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-14 01:37:02,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 125 events. 69/125 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 297 event pairs, 44 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-04-14 01:37:02,898 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-14 01:37:02,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 95 flow [2025-04-14 01:37:02,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:37:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:37:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-14 01:37:02,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-14 01:37:02,900 INFO L175 Difference]: Start difference. First operand has 19 places, 18 transitions, 55 flow. Second operand 3 states and 24 transitions. [2025-04-14 01:37:02,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 95 flow [2025-04-14 01:37:02,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 19 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:02,901 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 64 flow [2025-04-14 01:37:02,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-14 01:37:02,902 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-14 01:37:02,902 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 64 flow [2025-04-14 01:37:02,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:02,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:02,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:02,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:37:02,902 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:37:02,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash -754184280, now seen corresponding path program 1 times [2025-04-14 01:37:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:02,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109755637] [2025-04-14 01:37:02,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:02,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:37:02,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:02,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:03,109 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:37:03,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:03,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109755637] [2025-04-14 01:37:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109755637] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:03,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891646208] [2025-04-14 01:37:03,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:03,112 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:37:03,113 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:37:03,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:37:03,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:03,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:03,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:03,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:03,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:03,222 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:37:03,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891646208] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:37:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-14 01:37:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812179124] [2025-04-14 01:37:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:03,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:37:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:03,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:37:03,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:37:03,272 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:03,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:03,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:03,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:03,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:03,366 INFO L116 PetriNetUnfolderBase]: 76/137 cut-off events. [2025-04-14 01:37:03,366 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-14 01:37:03,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 137 events. 76/137 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 375 event pairs, 22 based on Foata normal form. 5/141 useless extension candidates. Maximal degree in co-relation 316. Up to 71 conditions per place. [2025-04-14 01:37:03,368 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2025-04-14 01:37:03,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 33 transitions, 166 flow [2025-04-14 01:37:03,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:37:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:37:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-14 01:37:03,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-14 01:37:03,369 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 64 flow. Second operand 4 states and 41 transitions. [2025-04-14 01:37:03,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 33 transitions, 166 flow [2025-04-14 01:37:03,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 162 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:03,370 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 86 flow [2025-04-14 01:37:03,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-14 01:37:03,371 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-14 01:37:03,371 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 86 flow [2025-04-14 01:37:03,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:03,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:03,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:03,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:03,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:03,576 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:37:03,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash -489653144, now seen corresponding path program 2 times [2025-04-14 01:37:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:03,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108895875] [2025-04-14 01:37:03,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:03,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:03,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:03,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:03,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:03,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:03,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108895875] [2025-04-14 01:37:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108895875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:03,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:03,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:37:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421884161] [2025-04-14 01:37:03,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:03,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:37:03,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:03,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:37:03,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:37:03,662 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:03,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:03,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:03,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:03,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:03,750 INFO L116 PetriNetUnfolderBase]: 86/159 cut-off events. [2025-04-14 01:37:03,751 INFO L117 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-04-14 01:37:03,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 159 events. 86/159 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 443 event pairs, 28 based on Foata normal form. 4/162 useless extension candidates. Maximal degree in co-relation 431. Up to 96 conditions per place. [2025-04-14 01:37:03,752 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 6 changer transitions 1/35 dead transitions. [2025-04-14 01:37:03,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 202 flow [2025-04-14 01:37:03,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:37:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:37:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-14 01:37:03,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:37:03,753 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 86 flow. Second operand 4 states and 38 transitions. [2025-04-14 01:37:03,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 202 flow [2025-04-14 01:37:03,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 197 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:03,755 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 119 flow [2025-04-14 01:37:03,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-04-14 01:37:03,755 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-14 01:37:03,756 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 119 flow [2025-04-14 01:37:03,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:03,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:03,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:03,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:37:03,756 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:37:03,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 120676575, now seen corresponding path program 1 times [2025-04-14 01:37:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:03,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017208913] [2025-04-14 01:37:03,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:03,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:37:03,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:03,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:03,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:03,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017208913] [2025-04-14 01:37:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017208913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:03,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:37:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805709236] [2025-04-14 01:37:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:03,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:37:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:03,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:37:03,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:37:03,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:03,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:03,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:03,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:03,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:03,962 INFO L116 PetriNetUnfolderBase]: 95/187 cut-off events. [2025-04-14 01:37:03,962 INFO L117 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2025-04-14 01:37:03,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 187 events. 95/187 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 649 event pairs, 32 based on Foata normal form. 9/195 useless extension candidates. Maximal degree in co-relation 606. Up to 115 conditions per place. [2025-04-14 01:37:03,964 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 33 selfloop transitions, 4 changer transitions 9/46 dead transitions. [2025-04-14 01:37:03,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 318 flow [2025-04-14 01:37:03,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:37:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:37:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-14 01:37:03,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2025-04-14 01:37:03,965 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 119 flow. Second operand 5 states and 48 transitions. [2025-04-14 01:37:03,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 318 flow [2025-04-14 01:37:03,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 294 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:03,968 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 139 flow [2025-04-14 01:37:03,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-04-14 01:37:03,968 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2025-04-14 01:37:03,968 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 139 flow [2025-04-14 01:37:03,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:03,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:03,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:03,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:37:03,969 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:37:03,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:03,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2034666967, now seen corresponding path program 2 times [2025-04-14 01:37:03,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:03,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373512547] [2025-04-14 01:37:03,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:03,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:03,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:03,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:04,059 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:37:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:04,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373512547] [2025-04-14 01:37:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373512547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:04,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380724637] [2025-04-14 01:37:04,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:04,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:04,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:04,061 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:37:04,062 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:37:04,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:04,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:04,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:04,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:04,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:04,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:04,147 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:37:04,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380724637] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:04,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:37:04,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-14 01:37:04,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715629356] [2025-04-14 01:37:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:04,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:37:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:04,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:37:04,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:37:04,250 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:04,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:04,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:04,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:04,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:04,332 INFO L116 PetriNetUnfolderBase]: 97/186 cut-off events. [2025-04-14 01:37:04,332 INFO L117 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-04-14 01:37:04,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 186 events. 97/186 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 580 event pairs, 34 based on Foata normal form. 4/189 useless extension candidates. Maximal degree in co-relation 672. Up to 125 conditions per place. [2025-04-14 01:37:04,335 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 29 selfloop transitions, 4 changer transitions 4/37 dead transitions. [2025-04-14 01:37:04,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 268 flow [2025-04-14 01:37:04,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:37:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:37:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-14 01:37:04,337 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-04-14 01:37:04,337 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 139 flow. Second operand 4 states and 40 transitions. [2025-04-14 01:37:04,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 268 flow [2025-04-14 01:37:04,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 255 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 01:37:04,339 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 160 flow [2025-04-14 01:37:04,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-04-14 01:37:04,340 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-04-14 01:37:04,340 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 160 flow [2025-04-14 01:37:04,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:04,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:04,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:04,348 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:37:04,547 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,SelfDestructingSolverStorable5 [2025-04-14 01:37:04,548 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:37:04,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -547745594, now seen corresponding path program 3 times [2025-04-14 01:37:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:04,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859976300] [2025-04-14 01:37:04,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:04,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:04,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:04,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:04,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:04,682 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:37:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:04,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859976300] [2025-04-14 01:37:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859976300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:04,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064900979] [2025-04-14 01:37:04,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:04,684 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:37:04,686 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:37:04,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:04,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:04,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:04,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:04,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:04,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:04,756 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:37:04,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:04,800 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:37:04,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064900979] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:04,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:04,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2025-04-14 01:37:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586339128] [2025-04-14 01:37:04,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:04,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:37:04,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:04,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:37:04,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:37:04,802 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:04,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 160 flow. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:04,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:04,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:04,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:04,943 INFO L116 PetriNetUnfolderBase]: 120/230 cut-off events. [2025-04-14 01:37:04,943 INFO L117 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-04-14 01:37:04,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 230 events. 120/230 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 827 event pairs, 31 based on Foata normal form. 5/234 useless extension candidates. Maximal degree in co-relation 862. Up to 111 conditions per place. [2025-04-14 01:37:04,945 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 39 selfloop transitions, 16 changer transitions 6/61 dead transitions. [2025-04-14 01:37:04,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 463 flow [2025-04-14 01:37:04,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:37:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:37:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2025-04-14 01:37:04,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2025-04-14 01:37:04,946 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 160 flow. Second operand 7 states and 66 transitions. [2025-04-14 01:37:04,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 463 flow [2025-04-14 01:37:04,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 456 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:37:04,948 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 270 flow [2025-04-14 01:37:04,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-04-14 01:37:04,949 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2025-04-14 01:37:04,949 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 270 flow [2025-04-14 01:37:04,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:04,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:04,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:04,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:05,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:05,150 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:37:05,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:05,150 INFO L85 PathProgramCache]: Analyzing trace with hash 672197055, now seen corresponding path program 3 times [2025-04-14 01:37:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:05,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179148351] [2025-04-14 01:37:05,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:05,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:05,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:05,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:05,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:05,233 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:37:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:05,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179148351] [2025-04-14 01:37:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179148351] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:05,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044301518] [2025-04-14 01:37:05,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:05,236 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:37:05,237 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:37:05,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:37:05,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:37:05,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:05,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:05,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:05,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:05,311 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:37:05,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:05,362 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:37:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044301518] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:05,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-14 01:37:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117052314] [2025-04-14 01:37:05,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:05,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:37:05,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:05,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:37:05,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:37:05,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:05,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 270 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:05,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:05,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:05,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:05,492 INFO L116 PetriNetUnfolderBase]: 142/264 cut-off events. [2025-04-14 01:37:05,493 INFO L117 PetriNetUnfolderBase]: For 831/831 co-relation queries the response was YES. [2025-04-14 01:37:05,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 264 events. 142/264 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 957 event pairs, 36 based on Foata normal form. 20/283 useless extension candidates. Maximal degree in co-relation 1155. Up to 143 conditions per place. [2025-04-14 01:37:05,495 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 41 selfloop transitions, 14 changer transitions 9/64 dead transitions. [2025-04-14 01:37:05,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 572 flow [2025-04-14 01:37:05,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:37:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:37:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-14 01:37:05,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-04-14 01:37:05,497 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 270 flow. Second operand 6 states and 58 transitions. [2025-04-14 01:37:05,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 572 flow [2025-04-14 01:37:05,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 558 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-04-14 01:37:05,501 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 344 flow [2025-04-14 01:37:05,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-04-14 01:37:05,502 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2025-04-14 01:37:05,502 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 344 flow [2025-04-14 01:37:05,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:05,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:05,502 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:05,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:05,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:05,705 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:37:05,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1103061045, now seen corresponding path program 4 times [2025-04-14 01:37:05,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:05,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77657820] [2025-04-14 01:37:05,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:05,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:37:05,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:37:05,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:05,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:05,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:05,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77657820] [2025-04-14 01:37:05,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77657820] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:05,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135460338] [2025-04-14 01:37:05,813 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:05,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:05,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:05,815 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:37:05,816 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:37:05,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:37:05,865 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:37:05,865 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:05,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:05,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:37:05,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:37:05,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:37:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135460338] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:05,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:05,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-14 01:37:05,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403648821] [2025-04-14 01:37:05,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:05,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:37:05,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:05,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:37:05,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:37:05,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:05,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 344 flow. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:05,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:05,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:05,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:06,102 INFO L116 PetriNetUnfolderBase]: 123/217 cut-off events. [2025-04-14 01:37:06,102 INFO L117 PetriNetUnfolderBase]: For 984/984 co-relation queries the response was YES. [2025-04-14 01:37:06,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 217 events. 123/217 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 661 event pairs, 38 based on Foata normal form. 7/223 useless extension candidates. Maximal degree in co-relation 1074. Up to 150 conditions per place. [2025-04-14 01:37:06,104 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 37 selfloop transitions, 15 changer transitions 2/54 dead transitions. [2025-04-14 01:37:06,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 563 flow [2025-04-14 01:37:06,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:37:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:37:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2025-04-14 01:37:06,105 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-14 01:37:06,105 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 344 flow. Second operand 6 states and 50 transitions. [2025-04-14 01:37:06,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 563 flow [2025-04-14 01:37:06,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 488 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-04-14 01:37:06,108 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 328 flow [2025-04-14 01:37:06,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-04-14 01:37:06,108 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2025-04-14 01:37:06,108 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 328 flow [2025-04-14 01:37:06,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:06,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:06,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:06,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:06,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:06,311 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:37:06,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash -588948315, now seen corresponding path program 1 times [2025-04-14 01:37:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:06,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102762653] [2025-04-14 01:37:06,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:06,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:37:06,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:37:06,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:06,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102762653] [2025-04-14 01:37:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102762653] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:06,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887639402] [2025-04-14 01:37:06,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:06,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:06,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:06,705 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:06,707 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:06,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:37:06,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:37:06,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:06,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:06,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-14 01:37:06,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:06,798 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 15 treesize of output 1 [2025-04-14 01:37:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:06,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:07,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 102 treesize of output 90 [2025-04-14 01:37:07,162 INFO L325 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2025-04-14 01:37:07,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 406 treesize of output 335 [2025-04-14 01:37:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887639402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:09,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:09,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-14 01:37:09,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053159744] [2025-04-14 01:37:09,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:09,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:37:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:09,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:37:09,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:37:09,549 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:09,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 328 flow. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 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:09,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:09,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:09,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:09,937 INFO L116 PetriNetUnfolderBase]: 316/554 cut-off events. [2025-04-14 01:37:09,937 INFO L117 PetriNetUnfolderBase]: For 1705/1705 co-relation queries the response was YES. [2025-04-14 01:37:09,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 554 events. 316/554 cut-off events. For 1705/1705 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2189 event pairs, 36 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2280. Up to 254 conditions per place. [2025-04-14 01:37:09,944 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 54 selfloop transitions, 25 changer transitions 46/125 dead transitions. [2025-04-14 01:37:09,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 125 transitions, 1211 flow [2025-04-14 01:37:09,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:37:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:37:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2025-04-14 01:37:09,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49760765550239233 [2025-04-14 01:37:09,947 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 328 flow. Second operand 11 states and 104 transitions. [2025-04-14 01:37:09,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 125 transitions, 1211 flow [2025-04-14 01:37:09,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 125 transitions, 1051 flow, removed 16 selfloop flow, removed 7 redundant places. [2025-04-14 01:37:09,952 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 503 flow [2025-04-14 01:37:09,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=503, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-04-14 01:37:09,953 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 39 predicate places. [2025-04-14 01:37:09,953 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 503 flow [2025-04-14 01:37:09,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 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:09,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:09,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:09,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:10,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:10,158 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:37:10,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1167125058, now seen corresponding path program 2 times [2025-04-14 01:37:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:10,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673694484] [2025-04-14 01:37:10,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:10,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:37:10,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:37:10,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:10,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:10,810 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:37:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:10,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673694484] [2025-04-14 01:37:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673694484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:10,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224436413] [2025-04-14 01:37:10,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:10,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:10,813 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:37:10,815 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:37:10,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:37:10,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:37:10,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:10,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:10,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 01:37:10,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:10,970 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:37:10,971 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-04-14 01:37:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:10,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:11,049 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-14 01:37:11,049 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-14 01:37:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224436413] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:11,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:11,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 3] total 14 [2025-04-14 01:37:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970275105] [2025-04-14 01:37:11,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:11,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:37:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:11,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:37:11,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:37:11,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:11,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 503 flow. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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:11,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:11,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:11,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:11,419 INFO L116 PetriNetUnfolderBase]: 287/509 cut-off events. [2025-04-14 01:37:11,419 INFO L117 PetriNetUnfolderBase]: For 1459/1459 co-relation queries the response was YES. [2025-04-14 01:37:11,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 509 events. 287/509 cut-off events. For 1459/1459 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1926 event pairs, 43 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 2393. Up to 340 conditions per place. [2025-04-14 01:37:11,422 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 78 selfloop transitions, 38 changer transitions 1/117 dead transitions. [2025-04-14 01:37:11,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 1151 flow [2025-04-14 01:37:11,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:37:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:37:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2025-04-14 01:37:11,423 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3824561403508772 [2025-04-14 01:37:11,423 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 503 flow. Second operand 15 states and 109 transitions. [2025-04-14 01:37:11,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 1151 flow [2025-04-14 01:37:11,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 117 transitions, 1070 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-04-14 01:37:11,428 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 772 flow [2025-04-14 01:37:11,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=772, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2025-04-14 01:37:11,431 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 48 predicate places. [2025-04-14 01:37:11,431 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 77 transitions, 772 flow [2025-04-14 01:37:11,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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:11,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:11,432 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:11,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:11,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:11,633 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:37:11,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash -433720834, now seen corresponding path program 3 times [2025-04-14 01:37:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:11,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130778441] [2025-04-14 01:37:11,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:11,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:37:11,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:37:11,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:11,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:12,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130778441] [2025-04-14 01:37:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130778441] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:12,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831141222] [2025-04-14 01:37:12,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:12,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:12,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:12,166 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:37:12,168 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:37:12,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:37:12,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:37:12,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:37:12,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:12,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 01:37:12,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:12,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:37:12,326 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-04-14 01:37:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:37:12,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:12,393 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-14 01:37:12,394 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-14 01:37:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:12,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831141222] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:12,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:12,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 3] total 14 [2025-04-14 01:37:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100260936] [2025-04-14 01:37:12,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:12,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:37:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:12,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:37:12,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:37:12,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:12,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 77 transitions, 772 flow. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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:12,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:12,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:12,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:12,685 INFO L116 PetriNetUnfolderBase]: 377/666 cut-off events. [2025-04-14 01:37:12,685 INFO L117 PetriNetUnfolderBase]: For 1883/1883 co-relation queries the response was YES. [2025-04-14 01:37:12,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 666 events. 377/666 cut-off events. For 1883/1883 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2757 event pairs, 62 based on Foata normal form. 1/666 useless extension candidates. Maximal degree in co-relation 2746. Up to 481 conditions per place. [2025-04-14 01:37:12,690 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 96 selfloop transitions, 36 changer transitions 1/133 dead transitions. [2025-04-14 01:37:12,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 1406 flow [2025-04-14 01:37:12,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:37:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:37:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 107 transitions. [2025-04-14 01:37:12,692 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37543859649122807 [2025-04-14 01:37:12,692 INFO L175 Difference]: Start difference. First operand has 68 places, 77 transitions, 772 flow. Second operand 15 states and 107 transitions. [2025-04-14 01:37:12,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 1406 flow [2025-04-14 01:37:12,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 1319 flow, removed 35 selfloop flow, removed 3 redundant places. [2025-04-14 01:37:12,700 INFO L231 Difference]: Finished difference. Result has 80 places, 95 transitions, 982 flow [2025-04-14 01:37:12,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=982, PETRI_PLACES=80, PETRI_TRANSITIONS=95} [2025-04-14 01:37:12,701 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 60 predicate places. [2025-04-14 01:37:12,701 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 95 transitions, 982 flow [2025-04-14 01:37:12,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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:12,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:12,701 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:12,712 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:37:12,901 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,SelfDestructingSolverStorable11 [2025-04-14 01:37:12,902 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:37:12,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash 722989357, now seen corresponding path program 4 times [2025-04-14 01:37:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:12,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513231147] [2025-04-14 01:37:12,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:12,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:12,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:12,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:13,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513231147] [2025-04-14 01:37:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513231147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:13,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177788946] [2025-04-14 01:37:13,014 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:13,016 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:37:13,017 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:37:13,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:13,068 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:13,068 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:13,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:13,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:13,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:13,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177788946] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:13,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-14 01:37:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514862305] [2025-04-14 01:37:13,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:13,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:37:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:13,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:37:13,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:37:13,272 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:13,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 95 transitions, 982 flow. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 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:13,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:13,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:13,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:25,793 INFO L116 PetriNetUnfolderBase]: 577/1027 cut-off events. [2025-04-14 01:37:25,794 INFO L117 PetriNetUnfolderBase]: For 2786/2786 co-relation queries the response was YES. [2025-04-14 01:37:25,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4864 conditions, 1027 events. 577/1027 cut-off events. For 2786/2786 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4758 event pairs, 69 based on Foata normal form. 10/1037 useless extension candidates. Maximal degree in co-relation 4231. Up to 360 conditions per place. [2025-04-14 01:37:25,801 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 129 selfloop transitions, 46 changer transitions 0/175 dead transitions. [2025-04-14 01:37:25,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 175 transitions, 1946 flow [2025-04-14 01:37:25,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:37:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:37:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2025-04-14 01:37:25,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4880382775119617 [2025-04-14 01:37:25,802 INFO L175 Difference]: Start difference. First operand has 80 places, 95 transitions, 982 flow. Second operand 11 states and 102 transitions. [2025-04-14 01:37:25,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 175 transitions, 1946 flow [2025-04-14 01:37:25,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 175 transitions, 1759 flow, removed 82 selfloop flow, removed 6 redundant places. [2025-04-14 01:37:25,812 INFO L231 Difference]: Finished difference. Result has 91 places, 114 transitions, 1251 flow [2025-04-14 01:37:25,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1251, PETRI_PLACES=91, PETRI_TRANSITIONS=114} [2025-04-14 01:37:25,812 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 71 predicate places. [2025-04-14 01:37:25,812 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 1251 flow [2025-04-14 01:37:25,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 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:25,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:25,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:25,819 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:37:26,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 01:37:26,013 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:37:26,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:26,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1709067148, now seen corresponding path program 5 times [2025-04-14 01:37:26,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:26,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170746903] [2025-04-14 01:37:26,014 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:37:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:26,019 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:26,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:26,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:26,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:26,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170746903] [2025-04-14 01:37:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170746903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:26,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227581006] [2025-04-14 01:37:26,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:37:26,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:26,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:26,163 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:37:26,165 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:37:26,208 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:26,247 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:26,247 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:26,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:26,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:26,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:26,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227581006] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:26,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:26,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-14 01:37:26,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147219843] [2025-04-14 01:37:26,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:26,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:37:26,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:26,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:37:26,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:37:26,370 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:26,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 1251 flow. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 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:26,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:26,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:26,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:26,944 INFO L116 PetriNetUnfolderBase]: 585/1093 cut-off events. [2025-04-14 01:37:26,944 INFO L117 PetriNetUnfolderBase]: For 5610/5610 co-relation queries the response was YES. [2025-04-14 01:37:26,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 1093 events. 585/1093 cut-off events. For 5610/5610 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5552 event pairs, 58 based on Foata normal form. 24/1117 useless extension candidates. Maximal degree in co-relation 5161. Up to 384 conditions per place. [2025-04-14 01:37:26,952 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 143 selfloop transitions, 87 changer transitions 23/253 dead transitions. [2025-04-14 01:37:26,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 253 transitions, 2839 flow [2025-04-14 01:37:26,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 01:37:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 01:37:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 151 transitions. [2025-04-14 01:37:26,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37844611528822053 [2025-04-14 01:37:26,953 INFO L175 Difference]: Start difference. First operand has 91 places, 114 transitions, 1251 flow. Second operand 21 states and 151 transitions. [2025-04-14 01:37:26,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 253 transitions, 2839 flow [2025-04-14 01:37:26,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 253 transitions, 2709 flow, removed 34 selfloop flow, removed 3 redundant places. [2025-04-14 01:37:26,968 INFO L231 Difference]: Finished difference. Result has 116 places, 164 transitions, 1927 flow [2025-04-14 01:37:26,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1927, PETRI_PLACES=116, PETRI_TRANSITIONS=164} [2025-04-14 01:37:26,969 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 96 predicate places. [2025-04-14 01:37:26,969 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 164 transitions, 1927 flow [2025-04-14 01:37:26,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 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:26,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:26,969 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:26,977 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:37:27,169 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,SelfDestructingSolverStorable13 [2025-04-14 01:37:27,170 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:37:27,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1629295876, now seen corresponding path program 6 times [2025-04-14 01:37:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:27,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11619373] [2025-04-14 01:37:27,170 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:37:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:27,184 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:27,196 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:27,196 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:37:27,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:27,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11619373] [2025-04-14 01:37:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11619373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:27,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762272270] [2025-04-14 01:37:27,321 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:37:27,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:27,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:27,323 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:37:27,325 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:37:27,360 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:27,375 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:27,376 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:37:27,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:27,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:27,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:27,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762272270] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:27,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-14 01:37:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803611061] [2025-04-14 01:37:27,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:27,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:37:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:37:27,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:37:27,543 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:27,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 164 transitions, 1927 flow. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:27,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:27,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:28,189 INFO L116 PetriNetUnfolderBase]: 582/1083 cut-off events. [2025-04-14 01:37:28,189 INFO L117 PetriNetUnfolderBase]: For 7472/7472 co-relation queries the response was YES. [2025-04-14 01:37:28,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6445 conditions, 1083 events. 582/1083 cut-off events. For 7472/7472 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5506 event pairs, 97 based on Foata normal form. 70/1153 useless extension candidates. Maximal degree in co-relation 6329. Up to 455 conditions per place. [2025-04-14 01:37:28,196 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 114 selfloop transitions, 149 changer transitions 5/268 dead transitions. [2025-04-14 01:37:28,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 268 transitions, 3618 flow [2025-04-14 01:37:28,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 01:37:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 01:37:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 156 transitions. [2025-04-14 01:37:28,197 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43213296398891965 [2025-04-14 01:37:28,197 INFO L175 Difference]: Start difference. First operand has 116 places, 164 transitions, 1927 flow. Second operand 19 states and 156 transitions. [2025-04-14 01:37:28,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 268 transitions, 3618 flow [2025-04-14 01:37:28,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 268 transitions, 3037 flow, removed 251 selfloop flow, removed 7 redundant places. [2025-04-14 01:37:28,220 INFO L231 Difference]: Finished difference. Result has 128 places, 214 transitions, 2798 flow [2025-04-14 01:37:28,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2798, PETRI_PLACES=128, PETRI_TRANSITIONS=214} [2025-04-14 01:37:28,221 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 108 predicate places. [2025-04-14 01:37:28,221 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 214 transitions, 2798 flow [2025-04-14 01:37:28,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:28,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:28,221 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:28,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:28,425 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,SelfDestructingSolverStorable14 [2025-04-14 01:37:28,425 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:28,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1734756016, now seen corresponding path program 7 times [2025-04-14 01:37:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:28,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155921636] [2025-04-14 01:37:28,425 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:37:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:28,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:37:28,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:28,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:28,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:28,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:28,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155921636] [2025-04-14 01:37:28,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155921636] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:28,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392921425] [2025-04-14 01:37:28,544 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:37:28,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:28,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:28,546 INFO L229 MonitoredProcess]: Starting monitored process 13 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:28,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:37:28,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:37:28,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:28,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:28,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:28,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:28,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:28,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392921425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:28,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-14 01:37:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235337144] [2025-04-14 01:37:28,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:28,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:37:28,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:28,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:37:28,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:37:28,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:28,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 214 transitions, 2798 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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:28,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:28,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:28,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:29,587 INFO L116 PetriNetUnfolderBase]: 617/1203 cut-off events. [2025-04-14 01:37:29,587 INFO L117 PetriNetUnfolderBase]: For 7804/7804 co-relation queries the response was YES. [2025-04-14 01:37:29,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 1203 events. 617/1203 cut-off events. For 7804/7804 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6569 event pairs, 61 based on Foata normal form. 19/1222 useless extension candidates. Maximal degree in co-relation 6792. Up to 351 conditions per place. [2025-04-14 01:37:29,596 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 137 selfloop transitions, 169 changer transitions 9/315 dead transitions. [2025-04-14 01:37:29,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 315 transitions, 4177 flow [2025-04-14 01:37:29,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:37:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:37:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 205 transitions. [2025-04-14 01:37:29,598 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34804753820033957 [2025-04-14 01:37:29,598 INFO L175 Difference]: Start difference. First operand has 128 places, 214 transitions, 2798 flow. Second operand 31 states and 205 transitions. [2025-04-14 01:37:29,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 315 transitions, 4177 flow [2025-04-14 01:37:29,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 315 transitions, 3713 flow, removed 190 selfloop flow, removed 5 redundant places. [2025-04-14 01:37:29,632 INFO L231 Difference]: Finished difference. Result has 158 places, 240 transitions, 3132 flow [2025-04-14 01:37:29,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3132, PETRI_PLACES=158, PETRI_TRANSITIONS=240} [2025-04-14 01:37:29,633 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 138 predicate places. [2025-04-14 01:37:29,633 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 240 transitions, 3132 flow [2025-04-14 01:37:29,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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:29,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:29,633 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:29,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 01:37:29,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:37:29,834 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:37:29,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1575866444, now seen corresponding path program 8 times [2025-04-14 01:37:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:29,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659633169] [2025-04-14 01:37:29,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:29,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:29,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:29,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:29,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:29,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659633169] [2025-04-14 01:37:29,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659633169] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:29,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247928934] [2025-04-14 01:37:29,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:37:29,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:29,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:29,977 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 01:37:30,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:30,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:30,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:37:30,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:30,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:30,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:30,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:30,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247928934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:30,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:30,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-14 01:37:30,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692386736] [2025-04-14 01:37:30,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:30,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:37:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:30,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:37:30,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:37:30,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:30,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 240 transitions, 3132 flow. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 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:37:30,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:30,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:30,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:31,437 INFO L116 PetriNetUnfolderBase]: 779/1526 cut-off events. [2025-04-14 01:37:31,438 INFO L117 PetriNetUnfolderBase]: For 9404/9404 co-relation queries the response was YES. [2025-04-14 01:37:31,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9285 conditions, 1526 events. 779/1526 cut-off events. For 9404/9404 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8989 event pairs, 72 based on Foata normal form. 25/1551 useless extension candidates. Maximal degree in co-relation 9011. Up to 390 conditions per place. [2025-04-14 01:37:31,449 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 208 selfloop transitions, 215 changer transitions 13/436 dead transitions. [2025-04-14 01:37:31,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 436 transitions, 5847 flow [2025-04-14 01:37:31,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:37:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-14 01:37:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 298 transitions. [2025-04-14 01:37:31,450 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35645933014354064 [2025-04-14 01:37:31,450 INFO L175 Difference]: Start difference. First operand has 158 places, 240 transitions, 3132 flow. Second operand 44 states and 298 transitions. [2025-04-14 01:37:31,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 436 transitions, 5847 flow [2025-04-14 01:37:31,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 436 transitions, 5408 flow, removed 81 selfloop flow, removed 9 redundant places. [2025-04-14 01:37:31,502 INFO L231 Difference]: Finished difference. Result has 202 places, 323 transitions, 4546 flow [2025-04-14 01:37:31,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2794, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4546, PETRI_PLACES=202, PETRI_TRANSITIONS=323} [2025-04-14 01:37:31,503 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 182 predicate places. [2025-04-14 01:37:31,503 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 323 transitions, 4546 flow [2025-04-14 01:37:31,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 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:37:31,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:31,503 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:31,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:37:31,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:37:31,707 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:37:31,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1681124774, now seen corresponding path program 9 times [2025-04-14 01:37:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:31,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142332123] [2025-04-14 01:37:31,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:31,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:37:31,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:31,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:37:31,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:31,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:31,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142332123] [2025-04-14 01:37:31,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142332123] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:31,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520694515] [2025-04-14 01:37:31,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:37:31,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:31,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:31,862 INFO L229 MonitoredProcess]: Starting monitored process 15 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:31,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 01:37:31,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:37:31,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:31,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:37:31,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:31,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:31,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:31,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520694515] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:32,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-14 01:37:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908412669] [2025-04-14 01:37:32,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:32,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:37:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:32,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:37:32,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:37:32,091 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:32,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 323 transitions, 4546 flow. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:32,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:32,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:32,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:37,647 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 [] [2025-04-14 01:37:38,815 INFO L116 PetriNetUnfolderBase]: 853/1704 cut-off events. [2025-04-14 01:37:38,815 INFO L117 PetriNetUnfolderBase]: For 11092/11092 co-relation queries the response was YES. [2025-04-14 01:37:38,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11090 conditions, 1704 events. 853/1704 cut-off events. For 11092/11092 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10363 event pairs, 86 based on Foata normal form. 35/1739 useless extension candidates. Maximal degree in co-relation 10823. Up to 453 conditions per place. [2025-04-14 01:37:38,826 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 178 selfloop transitions, 289 changer transitions 0/467 dead transitions. [2025-04-14 01:37:38,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 467 transitions, 6747 flow [2025-04-14 01:37:38,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-14 01:37:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-14 01:37:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 300 transitions. [2025-04-14 01:37:38,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32894736842105265 [2025-04-14 01:37:38,828 INFO L175 Difference]: Start difference. First operand has 202 places, 323 transitions, 4546 flow. Second operand 48 states and 300 transitions. [2025-04-14 01:37:38,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 467 transitions, 6747 flow [2025-04-14 01:37:38,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 467 transitions, 6249 flow, removed 170 selfloop flow, removed 9 redundant places. [2025-04-14 01:37:38,884 INFO L231 Difference]: Finished difference. Result has 246 places, 375 transitions, 5626 flow [2025-04-14 01:37:38,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4002, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=5626, PETRI_PLACES=246, PETRI_TRANSITIONS=375} [2025-04-14 01:37:38,885 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 226 predicate places. [2025-04-14 01:37:38,885 INFO L485 AbstractCegarLoop]: Abstraction has has 246 places, 375 transitions, 5626 flow [2025-04-14 01:37:38,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:38,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:38,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:38,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:37:39,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:39,086 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:37:39,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2078983996, now seen corresponding path program 10 times [2025-04-14 01:37:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:39,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873605014] [2025-04-14 01:37:39,087 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:39,090 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:39,099 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:39,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:39,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:39,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:39,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873605014] [2025-04-14 01:37:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873605014] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:39,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989571699] [2025-04-14 01:37:39,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:39,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:39,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:39,200 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:37:39,240 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:37:39,255 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:39,256 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:39,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:39,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:39,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:39,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989571699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:39,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-14 01:37:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657721212] [2025-04-14 01:37:39,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:39,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:37:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:39,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:37:39,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:37:39,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:39,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 375 transitions, 5626 flow. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:39,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:39,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:39,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:43,860 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 [] [2025-04-14 01:37:46,407 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:37:46,628 INFO L116 PetriNetUnfolderBase]: 1157/2254 cut-off events. [2025-04-14 01:37:46,628 INFO L117 PetriNetUnfolderBase]: For 17395/17395 co-relation queries the response was YES. [2025-04-14 01:37:46,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16266 conditions, 2254 events. 1157/2254 cut-off events. For 17395/17395 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14379 event pairs, 287 based on Foata normal form. 74/2328 useless extension candidates. Maximal degree in co-relation 15966. Up to 1467 conditions per place. [2025-04-14 01:37:46,668 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 346 selfloop transitions, 267 changer transitions 0/613 dead transitions. [2025-04-14 01:37:46,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 613 transitions, 10399 flow [2025-04-14 01:37:46,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 01:37:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-14 01:37:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 208 transitions. [2025-04-14 01:37:46,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34210526315789475 [2025-04-14 01:37:46,670 INFO L175 Difference]: Start difference. First operand has 246 places, 375 transitions, 5626 flow. Second operand 32 states and 208 transitions. [2025-04-14 01:37:46,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 613 transitions, 10399 flow [2025-04-14 01:37:46,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 613 transitions, 9582 flow, removed 248 selfloop flow, removed 21 redundant places. [2025-04-14 01:37:46,779 INFO L231 Difference]: Finished difference. Result has 271 places, 533 transitions, 8703 flow [2025-04-14 01:37:46,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=5144, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=8703, PETRI_PLACES=271, PETRI_TRANSITIONS=533} [2025-04-14 01:37:46,780 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 251 predicate places. [2025-04-14 01:37:46,780 INFO L485 AbstractCegarLoop]: Abstraction has has 271 places, 533 transitions, 8703 flow [2025-04-14 01:37:46,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:46,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:46,780 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:46,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-14 01:37:46,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:46,981 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:37:46,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1768998422, now seen corresponding path program 11 times [2025-04-14 01:37:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:46,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127757545] [2025-04-14 01:37:46,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:37:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:46,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:37:46,992 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:46,992 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:37:46,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:47,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:47,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127757545] [2025-04-14 01:37:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127757545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:47,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350623752] [2025-04-14 01:37:47,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:37:47,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:47,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:47,197 INFO L229 MonitoredProcess]: Starting monitored process 17 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:47,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:37:47,236 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:37:47,258 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:37:47,258 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:37:47,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:47,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:37:47,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:47,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350623752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:37:47,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:37:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-14 01:37:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859976349] [2025-04-14 01:37:47,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:37:47,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 01:37:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:47,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 01:37:47,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:37:47,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:37:47,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 533 transitions, 8703 flow. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:37:47,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:47,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:37:47,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:56,309 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 [] [2025-04-14 01:38:00,322 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 [] [2025-04-14 01:38:04,663 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 [] [2025-04-14 01:38:07,632 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:38:09,808 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:38:10,151 INFO L116 PetriNetUnfolderBase]: 1397/2742 cut-off events. [2025-04-14 01:38:10,151 INFO L117 PetriNetUnfolderBase]: For 30597/30597 co-relation queries the response was YES. [2025-04-14 01:38:10,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21079 conditions, 2742 events. 1397/2742 cut-off events. For 30597/30597 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18409 event pairs, 114 based on Foata normal form. 42/2784 useless extension candidates. Maximal degree in co-relation 20936. Up to 852 conditions per place. [2025-04-14 01:38:10,172 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 300 selfloop transitions, 418 changer transitions 18/736 dead transitions. [2025-04-14 01:38:10,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 736 transitions, 13017 flow [2025-04-14 01:38:10,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:38:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:38:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 250 transitions. [2025-04-14 01:38:10,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33738191632928477 [2025-04-14 01:38:10,173 INFO L175 Difference]: Start difference. First operand has 271 places, 533 transitions, 8703 flow. Second operand 39 states and 250 transitions. [2025-04-14 01:38:10,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 736 transitions, 13017 flow [2025-04-14 01:38:10,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 736 transitions, 12408 flow, removed 257 selfloop flow, removed 5 redundant places. [2025-04-14 01:38:10,399 INFO L231 Difference]: Finished difference. Result has 318 places, 647 transitions, 11861 flow [2025-04-14 01:38:10,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=8245, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=11861, PETRI_PLACES=318, PETRI_TRANSITIONS=647} [2025-04-14 01:38:10,399 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 298 predicate places. [2025-04-14 01:38:10,399 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 647 transitions, 11861 flow [2025-04-14 01:38:10,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:38:10,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:10,400 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:10,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 01:38:10,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:10,600 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:38:10,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1231205930, now seen corresponding path program 12 times [2025-04-14 01:38:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:10,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968271755] [2025-04-14 01:38:10,601 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:38:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:10,605 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:38:10,610 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:10,610 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:38:10,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:10,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:10,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968271755] [2025-04-14 01:38:10,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968271755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:10,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121767225] [2025-04-14 01:38:10,715 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:38:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:10,717 INFO L229 MonitoredProcess]: Starting monitored process 18 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:38:10,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:38:10,759 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:38:10,775 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:10,775 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:38:10,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:10,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:38:10,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:10,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121767225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:10,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:10,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-14 01:38:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504439177] [2025-04-14 01:38:10,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:10,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:38:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:10,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:38:10,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:38:10,932 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:38:10,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 647 transitions, 11861 flow. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:10,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:10,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:38:10,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:38:16,315 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 [] [2025-04-14 01:38:16,795 INFO L116 PetriNetUnfolderBase]: 1668/3344 cut-off events. [2025-04-14 01:38:16,796 INFO L117 PetriNetUnfolderBase]: For 45495/45495 co-relation queries the response was YES. [2025-04-14 01:38:16,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28087 conditions, 3344 events. 1668/3344 cut-off events. For 45495/45495 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 23880 event pairs, 230 based on Foata normal form. 36/3380 useless extension candidates. Maximal degree in co-relation 27740. Up to 1173 conditions per place. [2025-04-14 01:38:16,823 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 404 selfloop transitions, 471 changer transitions 6/881 dead transitions. [2025-04-14 01:38:16,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 881 transitions, 17649 flow [2025-04-14 01:38:16,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:38:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 01:38:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 214 transitions. [2025-04-14 01:38:16,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37543859649122807 [2025-04-14 01:38:16,825 INFO L175 Difference]: Start difference. First operand has 318 places, 647 transitions, 11861 flow. Second operand 30 states and 214 transitions. [2025-04-14 01:38:16,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 881 transitions, 17649 flow [2025-04-14 01:38:17,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 881 transitions, 16593 flow, removed 435 selfloop flow, removed 13 redundant places. [2025-04-14 01:38:17,342 INFO L231 Difference]: Finished difference. Result has 337 places, 757 transitions, 14883 flow [2025-04-14 01:38:17,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=11017, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=14883, PETRI_PLACES=337, PETRI_TRANSITIONS=757} [2025-04-14 01:38:17,343 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 317 predicate places. [2025-04-14 01:38:17,343 INFO L485 AbstractCegarLoop]: Abstraction has has 337 places, 757 transitions, 14883 flow [2025-04-14 01:38:17,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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:17,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:17,343 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:17,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:38:17,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:17,544 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:38:17,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash 465953122, now seen corresponding path program 13 times [2025-04-14 01:38:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:17,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763487149] [2025-04-14 01:38:17,546 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:38:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:17,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:38:17,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:38:17,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:17,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:17,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763487149] [2025-04-14 01:38:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763487149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:17,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92496520] [2025-04-14 01:38:17,677 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:38:17,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:17,678 INFO L229 MonitoredProcess]: Starting monitored process 19 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:38:17,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:38:17,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:38:17,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:17,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:38:17,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:17,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:38:17,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:17,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92496520] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:17,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:17,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-14 01:38:17,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504232542] [2025-04-14 01:38:17,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:17,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:38:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:17,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:38:17,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:38:17,859 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:38:17,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 757 transitions, 14883 flow. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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:17,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:17,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:38:17,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:38:19,316 INFO L116 PetriNetUnfolderBase]: 2279/4585 cut-off events. [2025-04-14 01:38:19,316 INFO L117 PetriNetUnfolderBase]: For 67740/67740 co-relation queries the response was YES. [2025-04-14 01:38:19,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39886 conditions, 4585 events. 2279/4585 cut-off events. For 67740/67740 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 34886 event pairs, 53 based on Foata normal form. 34/4619 useless extension candidates. Maximal degree in co-relation 39237. Up to 2113 conditions per place. [2025-04-14 01:38:19,372 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 862 selfloop transitions, 265 changer transitions 13/1140 dead transitions. [2025-04-14 01:38:19,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1140 transitions, 24806 flow [2025-04-14 01:38:19,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:38:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:38:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2025-04-14 01:38:19,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40225563909774437 [2025-04-14 01:38:19,377 INFO L175 Difference]: Start difference. First operand has 337 places, 757 transitions, 14883 flow. Second operand 14 states and 107 transitions. [2025-04-14 01:38:19,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1140 transitions, 24806 flow [2025-04-14 01:38:20,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 1140 transitions, 24155 flow, removed 188 selfloop flow, removed 16 redundant places. [2025-04-14 01:38:20,339 INFO L231 Difference]: Finished difference. Result has 344 places, 912 transitions, 18971 flow [2025-04-14 01:38:20,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=14336, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18971, PETRI_PLACES=344, PETRI_TRANSITIONS=912} [2025-04-14 01:38:20,341 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 324 predicate places. [2025-04-14 01:38:20,341 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 912 transitions, 18971 flow [2025-04-14 01:38:20,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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:20,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:20,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:20,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-14 01:38:20,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:20,543 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:38:20,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1481919668, now seen corresponding path program 14 times [2025-04-14 01:38:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:20,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593127324] [2025-04-14 01:38:20,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:38:20,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:20,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:38:20,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:20,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:38:20,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:20,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:20,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593127324] [2025-04-14 01:38:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593127324] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:20,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509041285] [2025-04-14 01:38:20,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:38:20,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:20,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:20,751 INFO L229 MonitoredProcess]: Starting monitored process 20 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:38:20,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 01:38:20,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:38:20,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:20,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:38:20,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:20,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:38:20,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:20,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:21,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509041285] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:21,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:21,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-14 01:38:21,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686801258] [2025-04-14 01:38:21,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:21,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:38:21,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:21,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:38:21,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:38:21,003 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:38:21,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 912 transitions, 18971 flow. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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:38:21,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:21,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:38:21,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:38:24,024 INFO L116 PetriNetUnfolderBase]: 2917/5714 cut-off events. [2025-04-14 01:38:24,024 INFO L117 PetriNetUnfolderBase]: For 88914/88914 co-relation queries the response was YES. [2025-04-14 01:38:24,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53332 conditions, 5714 events. 2917/5714 cut-off events. For 88914/88914 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 44395 event pairs, 50 based on Foata normal form. 60/5774 useless extension candidates. Maximal degree in co-relation 52749. Up to 2575 conditions per place. [2025-04-14 01:38:24,075 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 938 selfloop transitions, 527 changer transitions 12/1477 dead transitions. [2025-04-14 01:38:24,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 1477 transitions, 34313 flow [2025-04-14 01:38:24,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 01:38:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-14 01:38:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 239 transitions. [2025-04-14 01:38:24,077 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3399715504978663 [2025-04-14 01:38:24,077 INFO L175 Difference]: Start difference. First operand has 344 places, 912 transitions, 18971 flow. Second operand 37 states and 239 transitions. [2025-04-14 01:38:24,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 1477 transitions, 34313 flow [2025-04-14 01:38:25,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 1477 transitions, 34080 flow, removed 72 selfloop flow, removed 3 redundant places. [2025-04-14 01:38:25,728 INFO L231 Difference]: Finished difference. Result has 397 places, 1222 transitions, 28955 flow [2025-04-14 01:38:25,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=18787, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=28955, PETRI_PLACES=397, PETRI_TRANSITIONS=1222} [2025-04-14 01:38:25,729 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 377 predicate places. [2025-04-14 01:38:25,729 INFO L485 AbstractCegarLoop]: Abstraction has has 397 places, 1222 transitions, 28955 flow [2025-04-14 01:38:25,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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:38:25,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:25,729 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:25,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-14 01:38:25,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:25,930 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:38:25,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 192311052, now seen corresponding path program 15 times [2025-04-14 01:38:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:25,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896798117] [2025-04-14 01:38:25,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:38:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:25,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:38:25,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:25,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:38:25,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:26,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896798117] [2025-04-14 01:38:26,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896798117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:26,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908393575] [2025-04-14 01:38:26,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:38:26,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:26,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:26,171 INFO L229 MonitoredProcess]: Starting monitored process 21 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:38:26,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 01:38:26,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:38:26,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:26,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:38:26,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:26,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:38:26,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:26,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908393575] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:26,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-04-14 01:38:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687192658] [2025-04-14 01:38:26,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:26,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 01:38:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:26,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 01:38:26,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:38:26,596 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:38:26,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1222 transitions, 28955 flow. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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:26,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:26,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:38:26,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:38:40,122 INFO L116 PetriNetUnfolderBase]: 3574/7225 cut-off events. [2025-04-14 01:38:40,122 INFO L117 PetriNetUnfolderBase]: For 138602/138602 co-relation queries the response was YES. [2025-04-14 01:38:40,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71087 conditions, 7225 events. 3574/7225 cut-off events. For 138602/138602 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 60043 event pairs, 19 based on Foata normal form. 60/7285 useless extension candidates. Maximal degree in co-relation 70540. Up to 1887 conditions per place. [2025-04-14 01:38:40,190 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 485 selfloop transitions, 1421 changer transitions 15/1921 dead transitions. [2025-04-14 01:38:40,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1921 transitions, 46344 flow [2025-04-14 01:38:40,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-14 01:38:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2025-04-14 01:38:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 473 transitions. [2025-04-14 01:38:40,192 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3319298245614035 [2025-04-14 01:38:40,192 INFO L175 Difference]: Start difference. First operand has 397 places, 1222 transitions, 28955 flow. Second operand 75 states and 473 transitions. [2025-04-14 01:38:40,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1921 transitions, 46344 flow [2025-04-14 01:38:42,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 1921 transitions, 45433 flow, removed 351 selfloop flow, removed 7 redundant places. [2025-04-14 01:38:42,959 INFO L231 Difference]: Finished difference. Result has 493 places, 1726 transitions, 44709 flow [2025-04-14 01:38:42,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=28179, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=960, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=44709, PETRI_PLACES=493, PETRI_TRANSITIONS=1726} [2025-04-14 01:38:42,961 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 473 predicate places. [2025-04-14 01:38:42,961 INFO L485 AbstractCegarLoop]: Abstraction has has 493 places, 1726 transitions, 44709 flow [2025-04-14 01:38:42,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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:42,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:42,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:42,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-14 01:38:43,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-14 01:38:43,162 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:38:43,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:43,163 INFO L85 PathProgramCache]: Analyzing trace with hash 84371532, now seen corresponding path program 16 times [2025-04-14 01:38:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:43,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157723312] [2025-04-14 01:38:43,163 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:38:43,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:43,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:38:43,173 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:43,173 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:38:43,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:43,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:43,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157723312] [2025-04-14 01:38:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157723312] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:43,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748352594] [2025-04-14 01:38:43,317 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:38:43,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:43,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:43,319 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38:43,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 01:38:43,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:38:43,375 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:38:43,376 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:38:43,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:43,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:38:43,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:43,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748352594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:43,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-14 01:38:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193595273] [2025-04-14 01:38:43,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:43,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:38:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:43,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:38:43,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:38:43,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:38:43,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1726 transitions, 44709 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 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:43,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:43,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:38:43,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:38:52,008 INFO L116 PetriNetUnfolderBase]: 3724/7621 cut-off events. [2025-04-14 01:38:52,008 INFO L117 PetriNetUnfolderBase]: For 197228/197228 co-relation queries the response was YES. [2025-04-14 01:38:52,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83656 conditions, 7621 events. 3724/7621 cut-off events. For 197228/197228 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 64669 event pairs, 17 based on Foata normal form. 42/7663 useless extension candidates. Maximal degree in co-relation 83413. Up to 1944 conditions per place. [2025-04-14 01:38:52,104 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 847 selfloop transitions, 1108 changer transitions 22/1977 dead transitions. [2025-04-14 01:38:52,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 1977 transitions, 53703 flow [2025-04-14 01:38:52,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-14 01:38:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-04-14 01:38:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 346 transitions. [2025-04-14 01:38:52,106 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35020242914979755 [2025-04-14 01:38:52,106 INFO L175 Difference]: Start difference. First operand has 493 places, 1726 transitions, 44709 flow. Second operand 52 states and 346 transitions. [2025-04-14 01:38:52,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 1977 transitions, 53703 flow [2025-04-14 01:38:56,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 1977 transitions, 49681 flow, removed 1588 selfloop flow, removed 32 redundant places. [2025-04-14 01:38:56,848 INFO L231 Difference]: Finished difference. Result has 520 places, 1791 transitions, 46711 flow [2025-04-14 01:38:56,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=41114, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=46711, PETRI_PLACES=520, PETRI_TRANSITIONS=1791} [2025-04-14 01:38:56,850 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 500 predicate places. [2025-04-14 01:38:56,850 INFO L485 AbstractCegarLoop]: Abstraction has has 520 places, 1791 transitions, 46711 flow [2025-04-14 01:38:56,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 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:56,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:56,850 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:56,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-14 01:38:57,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-14 01:38:57,051 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:38:57,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1065812862, now seen corresponding path program 17 times [2025-04-14 01:38:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:57,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135912817] [2025-04-14 01:38:57,052 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:38:57,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:57,057 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:38:57,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:38:57,066 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:38:57,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:38:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:57,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135912817] [2025-04-14 01:38:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135912817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:57,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984152575] [2025-04-14 01:38:57,165 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:38:57,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:57,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:57,167 INFO L229 MonitoredProcess]: Starting monitored process 23 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:38:57,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 01:38:57,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:38:57,245 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:38:57,245 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:38:57,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:57,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:38:57,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:38:57,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:38:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984152575] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:57,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-14 01:38:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854601997] [2025-04-14 01:38:57,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:57,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:38:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:38:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:38:57,424 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:38:57,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 1791 transitions, 46711 flow. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 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:38:57,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:57,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:38:57,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:39:17,749 INFO L116 PetriNetUnfolderBase]: 3794/7735 cut-off events. [2025-04-14 01:39:17,750 INFO L117 PetriNetUnfolderBase]: For 202163/202163 co-relation queries the response was YES. [2025-04-14 01:39:17,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84534 conditions, 7735 events. 3794/7735 cut-off events. For 202163/202163 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 65718 event pairs, 46 based on Foata normal form. 36/7771 useless extension candidates. Maximal degree in co-relation 84328. Up to 4389 conditions per place. [2025-04-14 01:39:17,840 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 1011 selfloop transitions, 877 changer transitions 1/1889 dead transitions. [2025-04-14 01:39:17,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 1889 transitions, 52290 flow [2025-04-14 01:39:17,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:39:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:39:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 197 transitions. [2025-04-14 01:39:17,841 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3840155945419103 [2025-04-14 01:39:17,841 INFO L175 Difference]: Start difference. First operand has 520 places, 1791 transitions, 46711 flow. Second operand 27 states and 197 transitions. [2025-04-14 01:39:17,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 1889 transitions, 52290 flow [2025-04-14 01:39:22,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 1889 transitions, 51544 flow, removed 96 selfloop flow, removed 18 redundant places. [2025-04-14 01:39:22,946 INFO L231 Difference]: Finished difference. Result has 535 places, 1816 transitions, 49324 flow [2025-04-14 01:39:22,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=46008, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=854, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=49324, PETRI_PLACES=535, PETRI_TRANSITIONS=1816} [2025-04-14 01:39:22,948 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 515 predicate places. [2025-04-14 01:39:22,948 INFO L485 AbstractCegarLoop]: Abstraction has has 535 places, 1816 transitions, 49324 flow [2025-04-14 01:39:22,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 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:39:22,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:39:22,948 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:39:22,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-14 01:39:23,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 01:39:23,149 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:39:23,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:39:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1611478004, now seen corresponding path program 18 times [2025-04-14 01:39:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:39:23,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919810401] [2025-04-14 01:39:23,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:39:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:39:23,154 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:39:23,159 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:39:23,160 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:39:23,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:39:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:39:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:39:23,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919810401] [2025-04-14 01:39:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919810401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:39:23,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169792071] [2025-04-14 01:39:23,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:39:23,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:39:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:39:23,253 INFO L229 MonitoredProcess]: Starting monitored process 24 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:39:23,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 01:39:23,296 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:39:23,309 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:39:23,309 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:39:23,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:39:23,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:39:23,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:39:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:39:23,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:39:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:39:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169792071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:39:23,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:39:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-14 01:39:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328715021] [2025-04-14 01:39:23,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:39:23,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:39:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:39:23,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:39:23,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:39:23,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:39:23,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 1816 transitions, 49324 flow. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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:39:23,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:39:23,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:39:23,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:39:49,358 INFO L116 PetriNetUnfolderBase]: 3919/7997 cut-off events. [2025-04-14 01:39:49,359 INFO L117 PetriNetUnfolderBase]: For 235131/235131 co-relation queries the response was YES. [2025-04-14 01:39:49,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90179 conditions, 7997 events. 3919/7997 cut-off events. For 235131/235131 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 68520 event pairs, 46 based on Foata normal form. 34/8031 useless extension candidates. Maximal degree in co-relation 89703. Up to 4446 conditions per place. [2025-04-14 01:39:49,443 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 997 selfloop transitions, 920 changer transitions 1/1918 dead transitions. [2025-04-14 01:39:49,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 1918 transitions, 55263 flow [2025-04-14 01:39:49,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 01:39:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 01:39:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 170 transitions. [2025-04-14 01:39:49,445 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37280701754385964 [2025-04-14 01:39:49,445 INFO L175 Difference]: Start difference. First operand has 535 places, 1816 transitions, 49324 flow. Second operand 24 states and 170 transitions. [2025-04-14 01:39:49,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 1918 transitions, 55263 flow [2025-04-14 01:39:54,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 1918 transitions, 53909 flow, removed 298 selfloop flow, removed 16 redundant places. [2025-04-14 01:39:54,886 INFO L231 Difference]: Finished difference. Result has 547 places, 1852 transitions, 51078 flow [2025-04-14 01:39:54,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48024, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=885, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=51078, PETRI_PLACES=547, PETRI_TRANSITIONS=1852} [2025-04-14 01:39:54,887 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 527 predicate places. [2025-04-14 01:39:54,887 INFO L485 AbstractCegarLoop]: Abstraction has has 547 places, 1852 transitions, 51078 flow [2025-04-14 01:39:54,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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:39:54,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:39:54,888 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:39:54,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 01:39:55,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:39:55,088 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:39:55,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:39:55,089 INFO L85 PathProgramCache]: Analyzing trace with hash 185963074, now seen corresponding path program 19 times [2025-04-14 01:39:55,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:39:55,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954117672] [2025-04-14 01:39:55,089 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:39:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:39:55,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:39:55,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:39:55,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:39:55,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:39:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:39:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:39:55,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954117672] [2025-04-14 01:39:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954117672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:39:55,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708233181] [2025-04-14 01:39:55,188 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:39:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:39:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:39:55,190 INFO L229 MonitoredProcess]: Starting monitored process 25 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:39:55,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 01:39:55,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:39:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:39:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:39:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:39:55,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:39:55,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:39:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:39:55,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:39:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:39:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708233181] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:39:55,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:39:55,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-14 01:39:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021137289] [2025-04-14 01:39:55,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:39:55,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:39:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:39:55,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:39:55,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:39:55,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:39:55,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1852 transitions, 51078 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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:39:55,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:39:55,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:39:55,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:40:00,351 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:40:20,166 INFO L116 PetriNetUnfolderBase]: 4069/8256 cut-off events. [2025-04-14 01:40:20,166 INFO L117 PetriNetUnfolderBase]: For 265210/265210 co-relation queries the response was YES. [2025-04-14 01:40:20,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95399 conditions, 8256 events. 4069/8256 cut-off events. For 265210/265210 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 70856 event pairs, 1533 based on Foata normal form. 32/8288 useless extension candidates. Maximal degree in co-relation 94908. Up to 7372 conditions per place. [2025-04-14 01:40:20,260 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 1727 selfloop transitions, 258 changer transitions 0/1985 dead transitions. [2025-04-14 01:40:20,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 1985 transitions, 58276 flow [2025-04-14 01:40:20,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:40:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:40:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 191 transitions. [2025-04-14 01:40:20,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3723196881091618 [2025-04-14 01:40:20,262 INFO L175 Difference]: Start difference. First operand has 547 places, 1852 transitions, 51078 flow. Second operand 27 states and 191 transitions. [2025-04-14 01:40:20,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 1985 transitions, 58276 flow [2025-04-14 01:40:25,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 1985 transitions, 56252 flow, removed 432 selfloop flow, removed 15 redundant places. [2025-04-14 01:40:26,029 INFO L231 Difference]: Finished difference. Result has 573 places, 1906 transitions, 51953 flow [2025-04-14 01:40:26,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=49521, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=51953, PETRI_PLACES=573, PETRI_TRANSITIONS=1906} [2025-04-14 01:40:26,031 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 553 predicate places. [2025-04-14 01:40:26,031 INFO L485 AbstractCegarLoop]: Abstraction has has 573 places, 1906 transitions, 51953 flow [2025-04-14 01:40:26,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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:40:26,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:40:26,032 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:40:26,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 01:40:26,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-14 01:40:26,233 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:40:26,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:40:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1621772896, now seen corresponding path program 20 times [2025-04-14 01:40:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:40:26,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778961320] [2025-04-14 01:40:26,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:40:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:40:26,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:40:26,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:40:26,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:40:26,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:40:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:40:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:40:26,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778961320] [2025-04-14 01:40:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778961320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:40:26,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539092178] [2025-04-14 01:40:26,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:40:26,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:40:26,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:40:26,349 INFO L229 MonitoredProcess]: Starting monitored process 26 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:40:26,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 01:40:26,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:40:26,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:40:26,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:40:26,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:40:26,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:40:26,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:40:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:40:26,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:40:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:40:26,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539092178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:40:26,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:40:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-14 01:40:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671934670] [2025-04-14 01:40:26,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:40:26,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:40:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:40:26,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:40:26,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:40:26,614 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:40:26,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 1906 transitions, 51953 flow. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 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:40:26,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:40:26,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:40:26,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:40:34,873 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 [] [2025-04-14 01:40:39,085 INFO L116 PetriNetUnfolderBase]: 4162/8480 cut-off events. [2025-04-14 01:40:39,085 INFO L117 PetriNetUnfolderBase]: For 277875/277875 co-relation queries the response was YES. [2025-04-14 01:40:39,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99110 conditions, 8480 events. 4162/8480 cut-off events. For 277875/277875 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 73611 event pairs, 1488 based on Foata normal form. 29/8509 useless extension candidates. Maximal degree in co-relation 98607. Up to 7243 conditions per place. [2025-04-14 01:40:39,185 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 1699 selfloop transitions, 313 changer transitions 3/2015 dead transitions. [2025-04-14 01:40:39,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 2015 transitions, 58507 flow [2025-04-14 01:40:39,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 01:40:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 01:40:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 153 transitions. [2025-04-14 01:40:39,186 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38345864661654133 [2025-04-14 01:40:39,186 INFO L175 Difference]: Start difference. First operand has 573 places, 1906 transitions, 51953 flow. Second operand 21 states and 153 transitions. [2025-04-14 01:40:39,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 2015 transitions, 58507 flow [2025-04-14 01:40:45,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 2015 transitions, 57140 flow, removed 293 selfloop flow, removed 9 redundant places. [2025-04-14 01:40:45,303 INFO L231 Difference]: Finished difference. Result has 588 places, 1928 transitions, 52335 flow [2025-04-14 01:40:45,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=50460, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=52335, PETRI_PLACES=588, PETRI_TRANSITIONS=1928} [2025-04-14 01:40:45,304 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 568 predicate places. [2025-04-14 01:40:45,305 INFO L485 AbstractCegarLoop]: Abstraction has has 588 places, 1928 transitions, 52335 flow [2025-04-14 01:40:45,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 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:40:45,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:40:45,305 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:40:45,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 01:40:45,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 01:40:45,506 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:40:45,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:40:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1886195002, now seen corresponding path program 21 times [2025-04-14 01:40:45,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:40:45,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437809937] [2025-04-14 01:40:45,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:40:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:40:45,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:40:45,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:40:45,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:40:45,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:40:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:40:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:40:45,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437809937] [2025-04-14 01:40:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437809937] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:40:45,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037821083] [2025-04-14 01:40:45,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:40:45,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:40:45,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:40:45,618 INFO L229 MonitoredProcess]: Starting monitored process 27 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:40:45,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:40:45,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:40:45,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:40:45,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:40:45,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:40:45,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:40:45,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:40:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:40:45,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:40:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:40:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037821083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:40:46,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:40:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-14 01:40:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834909781] [2025-04-14 01:40:46,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:40:46,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:40:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:40:46,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:40:46,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:40:46,113 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:40:46,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 1928 transitions, 52335 flow. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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:40:46,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:40:46,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:40:46,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:40:52,047 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:41:08,727 INFO L116 PetriNetUnfolderBase]: 4629/9528 cut-off events. [2025-04-14 01:41:08,728 INFO L117 PetriNetUnfolderBase]: For 335307/335307 co-relation queries the response was YES. [2025-04-14 01:41:08,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111825 conditions, 9528 events. 4629/9528 cut-off events. For 335307/335307 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 85063 event pairs, 1194 based on Foata normal form. 22/9550 useless extension candidates. Maximal degree in co-relation 111319. Up to 5326 conditions per place. [2025-04-14 01:41:08,842 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 1683 selfloop transitions, 544 changer transitions 9/2236 dead transitions. [2025-04-14 01:41:08,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 2236 transitions, 64441 flow [2025-04-14 01:41:08,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:41:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:41:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 178 transitions. [2025-04-14 01:41:08,843 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37473684210526315 [2025-04-14 01:41:08,843 INFO L175 Difference]: Start difference. First operand has 588 places, 1928 transitions, 52335 flow. Second operand 25 states and 178 transitions. [2025-04-14 01:41:08,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 2236 transitions, 64441 flow [2025-04-14 01:41:15,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 2236 transitions, 63825 flow, removed 234 selfloop flow, removed 16 redundant places. [2025-04-14 01:41:15,875 INFO L231 Difference]: Finished difference. Result has 604 places, 2134 transitions, 59245 flow [2025-04-14 01:41:15,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=51914, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=350, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=59245, PETRI_PLACES=604, PETRI_TRANSITIONS=2134} [2025-04-14 01:41:15,877 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 584 predicate places. [2025-04-14 01:41:15,877 INFO L485 AbstractCegarLoop]: Abstraction has has 604 places, 2134 transitions, 59245 flow [2025-04-14 01:41:15,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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:15,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:15,878 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:15,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-14 01:41:16,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:16,078 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:41:16,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -175581694, now seen corresponding path program 22 times [2025-04-14 01:41:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:16,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118122278] [2025-04-14 01:41:16,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:41:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:16,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:41:16,088 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:41:16,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:41:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:41:16,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:16,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118122278] [2025-04-14 01:41:16,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118122278] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:16,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391852885] [2025-04-14 01:41:16,188 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:41:16,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:16,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:16,190 INFO L229 MonitoredProcess]: Starting monitored process 28 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:16,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 01:41:16,238 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:41:16,253 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:41:16,253 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:41:16,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:16,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:41:16,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:41:16,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:41:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391852885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:41:16,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:41:16,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-14 01:41:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024307504] [2025-04-14 01:41:16,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:41:16,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:41:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:16,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:41:16,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:41:16,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:16,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 2134 transitions, 59245 flow. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 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:16,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:16,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:16,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:22,122 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 [] [2025-04-14 01:41:26,798 INFO L116 PetriNetUnfolderBase]: 4636/9520 cut-off events. [2025-04-14 01:41:26,798 INFO L117 PetriNetUnfolderBase]: For 373295/373295 co-relation queries the response was YES. [2025-04-14 01:41:26,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117449 conditions, 9520 events. 4636/9520 cut-off events. For 373295/373295 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 84755 event pairs, 1295 based on Foata normal form. 6/9526 useless extension candidates. Maximal degree in co-relation 116934. Up to 5594 conditions per place. [2025-04-14 01:41:26,917 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 1816 selfloop transitions, 386 changer transitions 7/2209 dead transitions. [2025-04-14 01:41:26,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 2209 transitions, 65414 flow [2025-04-14 01:41:26,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 01:41:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 01:41:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 127 transitions. [2025-04-14 01:41:26,918 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3518005540166205 [2025-04-14 01:41:26,918 INFO L175 Difference]: Start difference. First operand has 604 places, 2134 transitions, 59245 flow. Second operand 19 states and 127 transitions. [2025-04-14 01:41:26,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 2209 transitions, 65414 flow [2025-04-14 01:41:35,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 2209 transitions, 63790 flow, removed 759 selfloop flow, removed 8 redundant places. [2025-04-14 01:41:35,217 INFO L231 Difference]: Finished difference. Result has 616 places, 2140 transitions, 59175 flow [2025-04-14 01:41:35,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=57650, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=368, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=59175, PETRI_PLACES=616, PETRI_TRANSITIONS=2140} [2025-04-14 01:41:35,219 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 596 predicate places. [2025-04-14 01:41:35,219 INFO L485 AbstractCegarLoop]: Abstraction has has 616 places, 2140 transitions, 59175 flow [2025-04-14 01:41:35,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 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:35,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:35,219 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:35,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 01:41:35,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:35,420 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:41:35,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -695336352, now seen corresponding path program 23 times [2025-04-14 01:41:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:35,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622374610] [2025-04-14 01:41:35,421 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:41:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:35,425 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:41:35,431 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:41:35,431 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:41:35,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:41:35,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:35,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622374610] [2025-04-14 01:41:35,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622374610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:35,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000221069] [2025-04-14 01:41:35,512 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:41:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:35,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:35,514 INFO L229 MonitoredProcess]: Starting monitored process 29 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:35,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 01:41:35,555 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:41:35,581 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:41:35,581 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:41:35,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:35,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:41:35,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:41:35,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:41:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000221069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:41:35,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:41:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-14 01:41:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546814874] [2025-04-14 01:41:35,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:41:35,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:41:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:35,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:41:35,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:41:35,734 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:35,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 2140 transitions, 59175 flow. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 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:35,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:35,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:35,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:44,868 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:42:09,531 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:42:18,062 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:42:22,150 INFO L116 PetriNetUnfolderBase]: 4764/9770 cut-off events. [2025-04-14 01:42:22,151 INFO L117 PetriNetUnfolderBase]: For 385123/385123 co-relation queries the response was YES. [2025-04-14 01:42:22,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120828 conditions, 9770 events. 4764/9770 cut-off events. For 385123/385123 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 87353 event pairs, 1892 based on Foata normal form. 46/9816 useless extension candidates. Maximal degree in co-relation 120306. Up to 9165 conditions per place. [2025-04-14 01:42:22,271 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 2090 selfloop transitions, 203 changer transitions 0/2293 dead transitions. [2025-04-14 01:42:22,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 2293 transitions, 67497 flow [2025-04-14 01:42:22,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 01:42:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 01:42:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 211 transitions. [2025-04-14 01:42:22,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38294010889292196 [2025-04-14 01:42:22,273 INFO L175 Difference]: Start difference. First operand has 616 places, 2140 transitions, 59175 flow. Second operand 29 states and 211 transitions. [2025-04-14 01:42:22,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 2293 transitions, 67497 flow [2025-04-14 01:42:29,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 2293 transitions, 67041 flow, removed 110 selfloop flow, removed 10 redundant places. [2025-04-14 01:42:29,484 INFO L231 Difference]: Finished difference. Result has 650 places, 2200 transitions, 61539 flow [2025-04-14 01:42:29,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58721, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=61539, PETRI_PLACES=650, PETRI_TRANSITIONS=2200} [2025-04-14 01:42:29,486 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 630 predicate places. [2025-04-14 01:42:29,486 INFO L485 AbstractCegarLoop]: Abstraction has has 650 places, 2200 transitions, 61539 flow [2025-04-14 01:42:29,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 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:29,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:29,487 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:29,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-14 01:42:29,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:29,687 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:29,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1877319942, now seen corresponding path program 24 times [2025-04-14 01:42:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:29,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588826243] [2025-04-14 01:42:29,688 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:29,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:29,692 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:42:29,698 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:42:29,698 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:42:29,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:42:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:29,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588826243] [2025-04-14 01:42:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588826243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:29,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448548158] [2025-04-14 01:42:29,773 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:29,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:29,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:29,775 INFO L229 MonitoredProcess]: Starting monitored process 30 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:42:29,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 01:42:29,818 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:42:29,846 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:42:29,846 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:42:29,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:29,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:42:29,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:42:29,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:42:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448548158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:30,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-14 01:42:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141171175] [2025-04-14 01:42:30,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:30,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:42:30,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:30,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:42:30,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:42:30,007 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:30,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 2200 transitions, 61539 flow. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 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:42:30,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:30,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:30,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:36,371 INFO L116 PetriNetUnfolderBase]: 4783/9823 cut-off events. [2025-04-14 01:42:36,372 INFO L117 PetriNetUnfolderBase]: For 410399/410399 co-relation queries the response was YES. [2025-04-14 01:42:36,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122268 conditions, 9823 events. 4783/9823 cut-off events. For 410399/410399 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 88047 event pairs, 1899 based on Foata normal form. 22/9845 useless extension candidates. Maximal degree in co-relation 121731. Up to 9233 conditions per place. [2025-04-14 01:42:36,504 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 2116 selfloop transitions, 144 changer transitions 0/2260 dead transitions. [2025-04-14 01:42:36,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 2260 transitions, 67452 flow [2025-04-14 01:42:36,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:42:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:42:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2025-04-14 01:42:36,505 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40131578947368424 [2025-04-14 01:42:36,505 INFO L175 Difference]: Start difference. First operand has 650 places, 2200 transitions, 61539 flow. Second operand 16 states and 122 transitions. [2025-04-14 01:42:36,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 2260 transitions, 67452 flow [2025-04-14 01:42:45,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 2260 transitions, 66257 flow, removed 505 selfloop flow, removed 10 redundant places. [2025-04-14 01:42:45,084 INFO L231 Difference]: Finished difference. Result has 658 places, 2200 transitions, 60839 flow [2025-04-14 01:42:45,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60231, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=60839, PETRI_PLACES=658, PETRI_TRANSITIONS=2200} [2025-04-14 01:42:45,086 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 638 predicate places. [2025-04-14 01:42:45,086 INFO L485 AbstractCegarLoop]: Abstraction has has 658 places, 2200 transitions, 60839 flow [2025-04-14 01:42:45,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 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:42:45,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:45,086 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:45,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 01:42:45,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:45,287 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:45,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash 322806406, now seen corresponding path program 25 times [2025-04-14 01:42:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:45,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487739914] [2025-04-14 01:42:45,288 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:42:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:45,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:42:45,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:42:45,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:45,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:42:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:45,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487739914] [2025-04-14 01:42:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487739914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:45,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77881666] [2025-04-14 01:42:45,407 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:42:45,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:45,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:45,409 INFO L229 MonitoredProcess]: Starting monitored process 31 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:42:45,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 01:42:45,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:42:45,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:42:45,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:45,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:45,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:42:45,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:42:45,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:42:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77881666] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:45,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-14 01:42:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358144400] [2025-04-14 01:42:45,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:45,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:42:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:45,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:42:45,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:42:45,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:45,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 2200 transitions, 60839 flow. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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:45,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:45,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:45,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:58,919 INFO L116 PetriNetUnfolderBase]: 5114/10501 cut-off events. [2025-04-14 01:42:58,920 INFO L117 PetriNetUnfolderBase]: For 447089/447089 co-relation queries the response was YES. [2025-04-14 01:42:59,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129954 conditions, 10501 events. 5114/10501 cut-off events. For 447089/447089 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 94819 event pairs, 1873 based on Foata normal form. 84/10585 useless extension candidates. Maximal degree in co-relation 129561. Up to 8980 conditions per place. [2025-04-14 01:42:59,065 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 2041 selfloop transitions, 366 changer transitions 3/2410 dead transitions. [2025-04-14 01:42:59,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 2410 transitions, 71232 flow [2025-04-14 01:42:59,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:42:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:42:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 148 transitions. [2025-04-14 01:42:59,066 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3894736842105263 [2025-04-14 01:42:59,066 INFO L175 Difference]: Start difference. First operand has 658 places, 2200 transitions, 60839 flow. Second operand 20 states and 148 transitions. [2025-04-14 01:42:59,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 2410 transitions, 71232 flow [2025-04-14 01:43:07,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 2410 transitions, 70680 flow, removed 173 selfloop flow, removed 10 redundant places. [2025-04-14 01:43:07,775 INFO L231 Difference]: Finished difference. Result has 671 places, 2328 transitions, 65335 flow [2025-04-14 01:43:07,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60100, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=65335, PETRI_PLACES=671, PETRI_TRANSITIONS=2328} [2025-04-14 01:43:07,777 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 651 predicate places. [2025-04-14 01:43:07,777 INFO L485 AbstractCegarLoop]: Abstraction has has 671 places, 2328 transitions, 65335 flow [2025-04-14 01:43:07,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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:07,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:07,777 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:07,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-14 01:43:07,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-14 01:43:07,978 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:07,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:07,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1657799738, now seen corresponding path program 26 times [2025-04-14 01:43:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:07,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730482916] [2025-04-14 01:43:07,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:43:07,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:07,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:43:07,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:43:07,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:43:07,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:43:08,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:08,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730482916] [2025-04-14 01:43:08,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730482916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:08,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641853031] [2025-04-14 01:43:08,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:43:08,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:08,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:08,065 INFO L229 MonitoredProcess]: Starting monitored process 32 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:08,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 01:43:08,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:43:08,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:43:08,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:43:08,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:08,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:43:08,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:08,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:43:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641853031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:43:08,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:43:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-14 01:43:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413228879] [2025-04-14 01:43:08,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:43:08,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:43:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:08,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:43:08,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:43:08,297 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:43:08,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 2328 transitions, 65335 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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:08,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:08,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:43:08,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:19,395 INFO L116 PetriNetUnfolderBase]: 5068/10326 cut-off events. [2025-04-14 01:43:19,396 INFO L117 PetriNetUnfolderBase]: For 456523/456523 co-relation queries the response was YES. [2025-04-14 01:43:19,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130573 conditions, 10326 events. 5068/10326 cut-off events. For 456523/456523 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 92383 event pairs, 1433 based on Foata normal form. 18/10344 useless extension candidates. Maximal degree in co-relation 130150. Up to 6123 conditions per place. [2025-04-14 01:43:19,529 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 1904 selfloop transitions, 478 changer transitions 2/2384 dead transitions. [2025-04-14 01:43:19,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 2384 transitions, 71282 flow [2025-04-14 01:43:19,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 01:43:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 01:43:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 141 transitions. [2025-04-14 01:43:19,530 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32265446224256294 [2025-04-14 01:43:19,530 INFO L175 Difference]: Start difference. First operand has 671 places, 2328 transitions, 65335 flow. Second operand 23 states and 141 transitions. [2025-04-14 01:43:19,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 2384 transitions, 71282 flow [2025-04-14 01:43:28,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 2384 transitions, 69866 flow, removed 640 selfloop flow, removed 18 redundant places. [2025-04-14 01:43:28,384 INFO L231 Difference]: Finished difference. Result has 677 places, 2334 transitions, 65544 flow [2025-04-14 01:43:28,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=63333, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=446, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=65544, PETRI_PLACES=677, PETRI_TRANSITIONS=2334} [2025-04-14 01:43:28,386 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 657 predicate places. [2025-04-14 01:43:28,386 INFO L485 AbstractCegarLoop]: Abstraction has has 677 places, 2334 transitions, 65544 flow [2025-04-14 01:43:28,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:28,386 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:28,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-14 01:43:28,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:28,586 INFO L403 AbstractCegarLoop]: === Iteration 36 === 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,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:28,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1307553244, now seen corresponding path program 27 times [2025-04-14 01:43:28,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:28,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269077615] [2025-04-14 01:43:28,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:43:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:28,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:43:28,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:43:28,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:43:28,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:28,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269077615] [2025-04-14 01:43:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269077615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:28,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329008589] [2025-04-14 01:43:28,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:43:28,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:28,695 INFO L229 MonitoredProcess]: Starting monitored process 33 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:28,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-14 01:43:28,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-14 01:43:28,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:43:28,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:43:28,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:28,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:43:28,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:28,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:43:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329008589] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:43:28,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:43:28,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-14 01:43:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605080448] [2025-04-14 01:43:28,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:43:28,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:43:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:28,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:43:28,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:43:28,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:43:28,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 2334 transitions, 65544 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:28,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:43:28,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:34,850 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 [] [2025-04-14 01:43:40,227 INFO L116 PetriNetUnfolderBase]: 5080/10364 cut-off events. [2025-04-14 01:43:40,227 INFO L117 PetriNetUnfolderBase]: For 464031/464031 co-relation queries the response was YES. [2025-04-14 01:43:40,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131959 conditions, 10364 events. 5080/10364 cut-off events. For 464031/464031 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 92974 event pairs, 1469 based on Foata normal form. 12/10376 useless extension candidates. Maximal degree in co-relation 131424. Up to 6189 conditions per place. [2025-04-14 01:43:40,364 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 2046 selfloop transitions, 357 changer transitions 11/2414 dead transitions. [2025-04-14 01:43:40,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 2414 transitions, 72314 flow [2025-04-14 01:43:40,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:43:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:43:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 170 transitions. [2025-04-14 01:43:40,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3313840155945419 [2025-04-14 01:43:40,366 INFO L175 Difference]: Start difference. First operand has 677 places, 2334 transitions, 65544 flow. Second operand 27 states and 170 transitions. [2025-04-14 01:43:40,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 2414 transitions, 72314 flow [2025-04-14 01:43:49,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 2414 transitions, 71463 flow, removed 353 selfloop flow, removed 10 redundant places. [2025-04-14 01:43:49,163 INFO L231 Difference]: Finished difference. Result has 695 places, 2339 transitions, 66313 flow [2025-04-14 01:43:49,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64622, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=66313, PETRI_PLACES=695, PETRI_TRANSITIONS=2339} [2025-04-14 01:43:49,165 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 675 predicate places. [2025-04-14 01:43:49,165 INFO L485 AbstractCegarLoop]: Abstraction has has 695 places, 2339 transitions, 66313 flow [2025-04-14 01:43:49,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 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:49,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:49,165 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:49,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-14 01:43:49,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:49,366 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:43:49,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2120809124, now seen corresponding path program 28 times [2025-04-14 01:43:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:49,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328640863] [2025-04-14 01:43:49,367 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:43:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:49,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:43:49,375 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:43:49,375 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:43:49,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:43:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:49,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328640863] [2025-04-14 01:43:49,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328640863] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:49,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291803633] [2025-04-14 01:43:49,486 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:43:49,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:49,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:49,488 INFO L229 MonitoredProcess]: Starting monitored process 34 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:49,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-14 01:43:49,536 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:43:49,548 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:43:49,549 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:43:49,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:49,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:43:49,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:49,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:43:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:43:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291803633] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:43:49,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:43:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-04-14 01:43:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924676420] [2025-04-14 01:43:49,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:43:49,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:43:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:49,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:43:49,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:43:49,735 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:43:49,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 2339 transitions, 66313 flow. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 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:49,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:49,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:43:49,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:57,029 INFO L116 PetriNetUnfolderBase]: 5113/10449 cut-off events. [2025-04-14 01:43:57,029 INFO L117 PetriNetUnfolderBase]: For 490665/490665 co-relation queries the response was YES. [2025-04-14 01:43:57,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134961 conditions, 10449 events. 5113/10449 cut-off events. For 490665/490665 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 94016 event pairs, 1726 based on Foata normal form. 46/10495 useless extension candidates. Maximal degree in co-relation 134419. Up to 8227 conditions per place. [2025-04-14 01:43:57,172 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 1919 selfloop transitions, 500 changer transitions 6/2425 dead transitions. [2025-04-14 01:43:57,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 2425 transitions, 73935 flow [2025-04-14 01:43:57,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:43:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:43:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2025-04-14 01:43:57,174 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3782894736842105 [2025-04-14 01:43:57,174 INFO L175 Difference]: Start difference. First operand has 695 places, 2339 transitions, 66313 flow. Second operand 16 states and 115 transitions. [2025-04-14 01:43:57,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 2425 transitions, 73935 flow [2025-04-14 01:44:05,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 2425 transitions, 73095 flow, removed 370 selfloop flow, removed 9 redundant places. [2025-04-14 01:44:05,673 INFO L231 Difference]: Finished difference. Result has 696 places, 2354 transitions, 68140 flow [2025-04-14 01:44:05,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=65327, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=472, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=68140, PETRI_PLACES=696, PETRI_TRANSITIONS=2354} [2025-04-14 01:44:05,674 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 676 predicate places. [2025-04-14 01:44:05,674 INFO L485 AbstractCegarLoop]: Abstraction has has 696 places, 2354 transitions, 68140 flow [2025-04-14 01:44:05,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 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:44:05,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:05,675 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:05,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-14 01:44:05,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-14 01:44:05,875 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:05,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash -443473204, now seen corresponding path program 29 times [2025-04-14 01:44:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:05,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227996146] [2025-04-14 01:44:05,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:44:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:05,881 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:44:05,894 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:44:05,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:44:05,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:06,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:06,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227996146] [2025-04-14 01:44:06,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227996146] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:06,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294737317] [2025-04-14 01:44:06,704 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:44:06,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:06,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:06,706 INFO L229 MonitoredProcess]: Starting monitored process 35 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:44:06,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-14 01:44:06,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:44:06,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:44:06,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:44:06,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:06,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-14 01:44:06,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:06,851 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 19 treesize of output 1 [2025-04-14 01:44:07,196 INFO L325 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2025-04-14 01:44:07,196 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 54 [2025-04-14 01:44:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:07,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:08,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 494 treesize of output 434 [2025-04-14 01:44:10,034 INFO L325 Elim1Store]: treesize reduction 5, result has 99.1 percent of original size [2025-04-14 01:44:10,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 19 new quantified variables, introduced 55 case distinctions, treesize of input 6153 treesize of output 2728 [2025-04-14 01:49:51,988 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-14 01:49:51,989 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 01:49:51,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-14 01:49:51,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-14 01:49:52,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-14 01:49:52,191 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-14 01:49:52,196 INFO L158 Benchmark]: Toolchain (without parser) took 770872.65ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 101.9MB in the beginning and 858.7MB in the end (delta: -756.7MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 01:49:52,196 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 159.4MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:49:52,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.26ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 87.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:49:52,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.48ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:49:52,196 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:49:52,200 INFO L158 Benchmark]: IcfgBuilder took 532.99ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 39.3MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-14 01:49:52,200 INFO L158 Benchmark]: TraceAbstraction took 770058.99ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 39.0MB in the beginning and 858.7MB in the end (delta: -819.7MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 01:49:52,201 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.31ms. Allocated memory is still 159.4MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.26ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 87.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.48ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 532.99ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 39.3MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 770058.99ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 39.0MB in the beginning and 858.7MB in the end (delta: -819.7MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...