/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/parallel-misc-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:53:56,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:53:56,263 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 00:53:56,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:53:56,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:53:56,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:53:56,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:53:56,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:53:56,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:53:56,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:53:56,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:53:56,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:53:56,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:53:56,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:53:56,296 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:53:56,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:53:56,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:53:56,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:53:56,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:53:56,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:53:56,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:53:56,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:53:56,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:56,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:53:56,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:56,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:53:56,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:53:56,298 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 00:53:56,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:53:56,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:53:56,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:53:56,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:53:56,504 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:53:56,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2025-04-14 00:53:57,762 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722214f25/f0cd9d389b42440994bf76e1cfd94ccd/FLAG92eb8f7a1 [2025-04-14 00:53:57,952 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:53:57,952 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2025-04-14 00:53:57,958 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722214f25/f0cd9d389b42440994bf76e1cfd94ccd/FLAG92eb8f7a1 [2025-04-14 00:53:58,763 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722214f25/f0cd9d389b42440994bf76e1cfd94ccd [2025-04-14 00:53:58,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:53:58,766 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:53:58,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:53:58,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:53:58,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:53:58,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:53:58" (1/1) ... [2025-04-14 00:53:58,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5230e244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:58, skipping insertion in model container [2025-04-14 00:53:58,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:53:58" (1/1) ... [2025-04-14 00:53:58,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:53:58,953 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/parallel-misc-5.wvr.c[3066,3079] [2025-04-14 00:53:58,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:53:58,966 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:53:58,987 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/parallel-misc-5.wvr.c[3066,3079] [2025-04-14 00:53:58,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:53:59,004 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:53:59,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59 WrapperNode [2025-04-14 00:53:59,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:53:59,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:53:59,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:53:59,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:53:59,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,032 INFO L138 Inliner]: procedures = 21, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-04-14 00:53:59,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:53:59,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:53:59,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:53:59,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:53:59,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,057 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:53:59,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:53:59,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:53:59,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:53:59,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:53:59,074 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (1/1) ... [2025-04-14 00:53:59,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:59,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:59,100 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 00:53:59,105 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 00:53:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:53:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:53:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:53:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:53:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:53:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:53:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:53:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:53:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:53:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:53:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:53:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:53:59,122 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 00:53:59,193 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:53:59,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:53:59,357 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:53:59,358 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:53:59,358 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:53:59,505 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:53:59,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:53:59 BoogieIcfgContainer [2025-04-14 00:53:59,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:53:59,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:53:59,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:53:59,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:53:59,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:53:58" (1/3) ... [2025-04-14 00:53:59,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c59d35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:53:59, skipping insertion in model container [2025-04-14 00:53:59,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:59" (2/3) ... [2025-04-14 00:53:59,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c59d35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:53:59, skipping insertion in model container [2025-04-14 00:53:59,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:53:59" (3/3) ... [2025-04-14 00:53:59,512 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2025-04-14 00:53:59,521 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:53:59,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-5.wvr.c that has 4 procedures, 31 locations, 31 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 00:53:59,522 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:53:59,568 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:53:59,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 89 flow [2025-04-14 00:53:59,618 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-14 00:53:59,619 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:53:59,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 4/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-04-14 00:53:59,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 34 transitions, 89 flow [2025-04-14 00:53:59,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 78 flow [2025-04-14 00:53:59,631 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:53:59,641 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;@27067bc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:53:59,641 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:53:59,654 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:53:59,654 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-14 00:53:59,654 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:53:59,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:59,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:59,655 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:59,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash -173648071, now seen corresponding path program 1 times [2025-04-14 00:53:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:59,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485157675] [2025-04-14 00:53:59,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:59,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:53:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:53:59,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:59,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:00,090 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 00:54:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:00,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485157675] [2025-04-14 00:54:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485157675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:00,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:54:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728220501] [2025-04-14 00:54:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:00,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:54:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:00,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:54:00,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:54:00,115 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:00,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:00,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:00,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:00,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:00,496 INFO L116 PetriNetUnfolderBase]: 1551/2202 cut-off events. [2025-04-14 00:54:00,497 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-14 00:54:00,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4557 conditions, 2202 events. 1551/2202 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9657 event pairs, 66 based on Foata normal form. 0/1838 useless extension candidates. Maximal degree in co-relation 4458. Up to 772 conditions per place. [2025-04-14 00:54:00,511 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 72 selfloop transitions, 8 changer transitions 6/90 dead transitions. [2025-04-14 00:54:00,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 90 transitions, 385 flow [2025-04-14 00:54:00,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:54:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:54:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-04-14 00:54:00,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2025-04-14 00:54:00,523 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 78 flow. Second operand 6 states and 130 transitions. [2025-04-14 00:54:00,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 90 transitions, 385 flow [2025-04-14 00:54:00,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 90 transitions, 363 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:54:00,532 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 116 flow [2025-04-14 00:54:00,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-04-14 00:54:00,537 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2025-04-14 00:54:00,537 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 116 flow [2025-04-14 00:54:00,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:00,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:00,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:00,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:54:00,538 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:00,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1818610908, now seen corresponding path program 1 times [2025-04-14 00:54:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:00,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999396462] [2025-04-14 00:54:00,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:00,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:54:00,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:54:00,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:00,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:00,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:00,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999396462] [2025-04-14 00:54:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999396462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:00,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:00,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:54:00,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85933242] [2025-04-14 00:54:00,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:00,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:54:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:00,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:54:00,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:54:00,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:00,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:00,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:00,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:00,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:00,811 INFO L116 PetriNetUnfolderBase]: 1416/2070 cut-off events. [2025-04-14 00:54:00,811 INFO L117 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2025-04-14 00:54:00,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4903 conditions, 2070 events. 1416/2070 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8846 event pairs, 444 based on Foata normal form. 66/1777 useless extension candidates. Maximal degree in co-relation 4063. Up to 1199 conditions per place. [2025-04-14 00:54:00,821 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 51 selfloop transitions, 2 changer transitions 1/58 dead transitions. [2025-04-14 00:54:00,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 288 flow [2025-04-14 00:54:00,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:54:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:54:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-14 00:54:00,824 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-14 00:54:00,824 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 116 flow. Second operand 3 states and 69 transitions. [2025-04-14 00:54:00,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 288 flow [2025-04-14 00:54:00,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:54:00,826 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 130 flow [2025-04-14 00:54:00,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-04-14 00:54:00,827 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2025-04-14 00:54:00,827 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 130 flow [2025-04-14 00:54:00,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:00,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:00,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:00,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:54:00,827 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:00,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash -336769854, now seen corresponding path program 1 times [2025-04-14 00:54:00,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:00,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383672942] [2025-04-14 00:54:00,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:00,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:54:00,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:54:00,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:00,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:00,902 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 00:54:00,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:00,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383672942] [2025-04-14 00:54:00,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383672942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:00,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:00,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:54:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675753934] [2025-04-14 00:54:00,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:00,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:54:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:00,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:54:00,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:54:00,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:00,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:00,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:00,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:00,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:01,086 INFO L116 PetriNetUnfolderBase]: 2005/2943 cut-off events. [2025-04-14 00:54:01,086 INFO L117 PetriNetUnfolderBase]: For 1283/1283 co-relation queries the response was YES. [2025-04-14 00:54:01,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 2943 events. 2005/2943 cut-off events. For 1283/1283 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13051 event pairs, 693 based on Foata normal form. 70/2450 useless extension candidates. Maximal degree in co-relation 6336. Up to 1857 conditions per place. [2025-04-14 00:54:01,099 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 51 selfloop transitions, 2 changer transitions 1/58 dead transitions. [2025-04-14 00:54:01,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 310 flow [2025-04-14 00:54:01,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:54:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:54:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-14 00:54:01,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6568627450980392 [2025-04-14 00:54:01,100 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 130 flow. Second operand 3 states and 67 transitions. [2025-04-14 00:54:01,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 310 flow [2025-04-14 00:54:01,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:54:01,102 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 144 flow [2025-04-14 00:54:01,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-04-14 00:54:01,103 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-04-14 00:54:01,103 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 144 flow [2025-04-14 00:54:01,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:01,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:01,103 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:01,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:54:01,103 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:01,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1843663495, now seen corresponding path program 1 times [2025-04-14 00:54:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:01,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892579418] [2025-04-14 00:54:01,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:01,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:54:01,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:54:01,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:01,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:01,226 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 00:54:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:01,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892579418] [2025-04-14 00:54:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892579418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:54:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723608812] [2025-04-14 00:54:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:01,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:54:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:01,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:54:01,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:54:01,227 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:01,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 00:54:01,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:01,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:01,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:01,438 INFO L116 PetriNetUnfolderBase]: 1769/2591 cut-off events. [2025-04-14 00:54:01,438 INFO L117 PetriNetUnfolderBase]: For 1426/1426 co-relation queries the response was YES. [2025-04-14 00:54:01,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6717 conditions, 2591 events. 1769/2591 cut-off events. For 1426/1426 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10843 event pairs, 145 based on Foata normal form. 0/2168 useless extension candidates. Maximal degree in co-relation 5744. Up to 1268 conditions per place. [2025-04-14 00:54:01,450 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 55 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-04-14 00:54:01,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 357 flow [2025-04-14 00:54:01,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:54:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:54:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-14 00:54:01,451 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2025-04-14 00:54:01,451 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 144 flow. Second operand 4 states and 78 transitions. [2025-04-14 00:54:01,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 357 flow [2025-04-14 00:54:01,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:54:01,453 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 169 flow [2025-04-14 00:54:01,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-04-14 00:54:01,453 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-04-14 00:54:01,454 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 169 flow [2025-04-14 00:54:01,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 00:54:01,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:01,454 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:01,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:54:01,454 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:01,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash 642505267, now seen corresponding path program 2 times [2025-04-14 00:54:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:01,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273555143] [2025-04-14 00:54:01,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:54:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:01,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:54:01,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-04-14 00:54:01,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:54:01,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:01,582 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 00:54:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:01,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273555143] [2025-04-14 00:54:01,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273555143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:01,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:01,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:54:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905208566] [2025-04-14 00:54:01,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:01,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:54:01,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:01,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:54:01,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:54:01,583 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:01,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 00:54:01,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:01,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:01,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:01,883 INFO L116 PetriNetUnfolderBase]: 2277/3316 cut-off events. [2025-04-14 00:54:01,883 INFO L117 PetriNetUnfolderBase]: For 2191/2191 co-relation queries the response was YES. [2025-04-14 00:54:01,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8807 conditions, 3316 events. 2277/3316 cut-off events. For 2191/2191 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14886 event pairs, 199 based on Foata normal form. 60/2915 useless extension candidates. Maximal degree in co-relation 7861. Up to 1318 conditions per place. [2025-04-14 00:54:01,899 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 70 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-04-14 00:54:01,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 81 transitions, 461 flow [2025-04-14 00:54:01,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:54:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:54:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 00:54:01,902 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5941176470588235 [2025-04-14 00:54:01,902 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 169 flow. Second operand 5 states and 101 transitions. [2025-04-14 00:54:01,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 81 transitions, 461 flow [2025-04-14 00:54:01,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:54:01,909 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 188 flow [2025-04-14 00:54:01,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-04-14 00:54:01,910 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2025-04-14 00:54:01,910 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 188 flow [2025-04-14 00:54:01,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 00:54:01,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:01,910 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:01,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:54:01,910 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:01,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:01,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1864475359, now seen corresponding path program 3 times [2025-04-14 00:54:01,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:01,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569492185] [2025-04-14 00:54:01,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:54:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:01,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:54:01,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-04-14 00:54:01,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:54:01,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:02,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:02,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569492185] [2025-04-14 00:54:02,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569492185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:02,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:02,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:54:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598961211] [2025-04-14 00:54:02,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:02,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:54:02,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:02,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:54:02,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:54:02,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:02,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 00:54:02,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:02,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:02,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:02,329 INFO L116 PetriNetUnfolderBase]: 3198/4642 cut-off events. [2025-04-14 00:54:02,329 INFO L117 PetriNetUnfolderBase]: For 3871/3871 co-relation queries the response was YES. [2025-04-14 00:54:02,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12514 conditions, 4642 events. 3198/4642 cut-off events. For 3871/3871 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21772 event pairs, 652 based on Foata normal form. 110/4093 useless extension candidates. Maximal degree in co-relation 9373. Up to 1880 conditions per place. [2025-04-14 00:54:02,346 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 73 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-04-14 00:54:02,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 505 flow [2025-04-14 00:54:02,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:54:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:54:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-14 00:54:02,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-04-14 00:54:02,347 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 188 flow. Second operand 5 states and 100 transitions. [2025-04-14 00:54:02,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 505 flow [2025-04-14 00:54:02,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 491 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:54:02,352 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 198 flow [2025-04-14 00:54:02,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-04-14 00:54:02,353 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-04-14 00:54:02,353 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 198 flow [2025-04-14 00:54:02,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 00:54:02,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:02,353 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:02,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:54:02,353 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:02,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1686652407, now seen corresponding path program 4 times [2025-04-14 00:54:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:02,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742715605] [2025-04-14 00:54:02,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:54:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:02,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:54:02,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:54:02,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:54:02,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:02,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742715605] [2025-04-14 00:54:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742715605] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:54:02,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485852484] [2025-04-14 00:54:02,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:54:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:54:02,542 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 00:54:02,543 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 00:54:02,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:54:02,599 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:54:02,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:54:02,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:02,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 00:54:02,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:54:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:02,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:54:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485852484] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:54:02,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:54:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 15 [2025-04-14 00:54:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913557308] [2025-04-14 00:54:02,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:54:02,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:54:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:02,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:54:02,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:54:02,885 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:02,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 198 flow. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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 00:54:02,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:02,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:04,130 INFO L116 PetriNetUnfolderBase]: 12280/17711 cut-off events. [2025-04-14 00:54:04,131 INFO L117 PetriNetUnfolderBase]: For 14189/14189 co-relation queries the response was YES. [2025-04-14 00:54:04,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48361 conditions, 17711 events. 12280/17711 cut-off events. For 14189/14189 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 102303 event pairs, 1067 based on Foata normal form. 300/15538 useless extension candidates. Maximal degree in co-relation 38636. Up to 3944 conditions per place. [2025-04-14 00:54:04,185 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 223 selfloop transitions, 58 changer transitions 36/321 dead transitions. [2025-04-14 00:54:04,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 321 transitions, 1925 flow [2025-04-14 00:54:04,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:54:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:54:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 406 transitions. [2025-04-14 00:54:04,186 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5970588235294118 [2025-04-14 00:54:04,186 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 198 flow. Second operand 20 states and 406 transitions. [2025-04-14 00:54:04,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 321 transitions, 1925 flow [2025-04-14 00:54:04,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 321 transitions, 1884 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:54:04,194 INFO L231 Difference]: Finished difference. Result has 85 places, 96 transitions, 779 flow [2025-04-14 00:54:04,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=779, PETRI_PLACES=85, PETRI_TRANSITIONS=96} [2025-04-14 00:54:04,195 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 49 predicate places. [2025-04-14 00:54:04,195 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 96 transitions, 779 flow [2025-04-14 00:54:04,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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 00:54:04,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:04,195 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:04,202 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 00:54:04,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:04,399 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:04,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash -131163286, now seen corresponding path program 5 times [2025-04-14 00:54:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:04,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884962329] [2025-04-14 00:54:04,400 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:54:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:04,405 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:54:04,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:54:04,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:54:04,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:54:04,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:04,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884962329] [2025-04-14 00:54:04,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884962329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:54:04,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629346420] [2025-04-14 00:54:04,464 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:54:04,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:04,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:54:04,467 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 00:54:04,468 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 00:54:04,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:54:04,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:54:04,514 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:54:04,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:04,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 00:54:04,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:54:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:04,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:54:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:54:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629346420] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:54:04,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:54:04,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-04-14 00:54:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936828127] [2025-04-14 00:54:04,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:54:04,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:54:04,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:04,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:54:04,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:54:04,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:04,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 96 transitions, 779 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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 00:54:04,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:04,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:05,713 INFO L116 PetriNetUnfolderBase]: 12620/18414 cut-off events. [2025-04-14 00:54:05,713 INFO L117 PetriNetUnfolderBase]: For 56537/56537 co-relation queries the response was YES. [2025-04-14 00:54:05,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72162 conditions, 18414 events. 12620/18414 cut-off events. For 56537/56537 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 105177 event pairs, 5426 based on Foata normal form. 222/16117 useless extension candidates. Maximal degree in co-relation 60929. Up to 7737 conditions per place. [2025-04-14 00:54:05,818 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 188 selfloop transitions, 20 changer transitions 5/217 dead transitions. [2025-04-14 00:54:05,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 217 transitions, 2153 flow [2025-04-14 00:54:05,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:54:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:54:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-04-14 00:54:05,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2025-04-14 00:54:05,820 INFO L175 Difference]: Start difference. First operand has 85 places, 96 transitions, 779 flow. Second operand 4 states and 100 transitions. [2025-04-14 00:54:05,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 217 transitions, 2153 flow [2025-04-14 00:54:06,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 217 transitions, 1886 flow, removed 113 selfloop flow, removed 5 redundant places. [2025-04-14 00:54:06,010 INFO L231 Difference]: Finished difference. Result has 85 places, 111 transitions, 890 flow [2025-04-14 00:54:06,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=890, PETRI_PLACES=85, PETRI_TRANSITIONS=111} [2025-04-14 00:54:06,011 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 49 predicate places. [2025-04-14 00:54:06,011 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 111 transitions, 890 flow [2025-04-14 00:54:06,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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 00:54:06,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:06,011 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:06,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:54:06,216 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,SelfDestructingSolverStorable7 [2025-04-14 00:54:06,216 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:06,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:06,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1965188368, now seen corresponding path program 1 times [2025-04-14 00:54:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:06,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892196827] [2025-04-14 00:54:06,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:06,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:54:06,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:54:06,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:06,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:06,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:06,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892196827] [2025-04-14 00:54:06,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892196827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:06,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:54:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021954432] [2025-04-14 00:54:06,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:06,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:54:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:06,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:54:06,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:54:06,289 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:06,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 111 transitions, 890 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 00:54:06,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:06,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:08,880 INFO L116 PetriNetUnfolderBase]: 27106/39596 cut-off events. [2025-04-14 00:54:08,880 INFO L117 PetriNetUnfolderBase]: For 115043/115043 co-relation queries the response was YES. [2025-04-14 00:54:09,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151861 conditions, 39596 events. 27106/39596 cut-off events. For 115043/115043 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 251434 event pairs, 11872 based on Foata normal form. 712/34881 useless extension candidates. Maximal degree in co-relation 141108. Up to 15024 conditions per place. [2025-04-14 00:54:09,134 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 218 selfloop transitions, 32 changer transitions 1/255 dead transitions. [2025-04-14 00:54:09,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 255 transitions, 2585 flow [2025-04-14 00:54:09,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:54:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:54:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-14 00:54:09,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-04-14 00:54:09,135 INFO L175 Difference]: Start difference. First operand has 85 places, 111 transitions, 890 flow. Second operand 4 states and 96 transitions. [2025-04-14 00:54:09,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 255 transitions, 2585 flow [2025-04-14 00:54:09,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 255 transitions, 2517 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-04-14 00:54:09,452 INFO L231 Difference]: Finished difference. Result has 90 places, 136 transitions, 1266 flow [2025-04-14 00:54:09,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1266, PETRI_PLACES=90, PETRI_TRANSITIONS=136} [2025-04-14 00:54:09,453 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 54 predicate places. [2025-04-14 00:54:09,453 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 136 transitions, 1266 flow [2025-04-14 00:54:09,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 00:54:09,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:09,453 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:09,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:54:09,454 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:09,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1400157581, now seen corresponding path program 6 times [2025-04-14 00:54:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:09,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649039936] [2025-04-14 00:54:09,454 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:54:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:09,459 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 3 equivalence classes. [2025-04-14 00:54:09,467 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:54:09,468 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:54:09,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:09,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649039936] [2025-04-14 00:54:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649039936] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:54:09,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864356033] [2025-04-14 00:54:09,628 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:54:09,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:54:09,630 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 00:54:09,631 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 00:54:09,670 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 3 equivalence classes. [2025-04-14 00:54:09,686 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:54:09,686 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:54:09,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:09,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:54:09,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:54:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:09,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:54:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864356033] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:54:09,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:54:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 16 [2025-04-14 00:54:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365366430] [2025-04-14 00:54:09,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:54:09,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:54:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:09,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:54:09,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:54:09,919 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:09,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 136 transitions, 1266 flow. Second operand has 17 states, 17 states have (on average 10.117647058823529) internal successors, (172), 17 states have internal predecessors, (172), 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 00:54:09,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:09,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:09,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:17,876 INFO L116 PetriNetUnfolderBase]: 72853/104992 cut-off events. [2025-04-14 00:54:17,876 INFO L117 PetriNetUnfolderBase]: For 369580/369580 co-relation queries the response was YES. [2025-04-14 00:54:18,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412793 conditions, 104992 events. 72853/104992 cut-off events. For 369580/369580 co-relation queries the response was YES. Maximal size of possible extension queue 3185. Compared 720983 event pairs, 7679 based on Foata normal form. 2900/93265 useless extension candidates. Maximal degree in co-relation 380666. Up to 23088 conditions per place. [2025-04-14 00:54:18,479 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 303 selfloop transitions, 222 changer transitions 209/738 dead transitions. [2025-04-14 00:54:18,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 738 transitions, 7627 flow [2025-04-14 00:54:18,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:54:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:54:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 493 transitions. [2025-04-14 00:54:18,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-04-14 00:54:18,482 INFO L175 Difference]: Start difference. First operand has 90 places, 136 transitions, 1266 flow. Second operand 24 states and 493 transitions. [2025-04-14 00:54:18,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 738 transitions, 7627 flow [2025-04-14 00:54:19,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 738 transitions, 7417 flow, removed 105 selfloop flow, removed 0 redundant places. [2025-04-14 00:54:19,420 INFO L231 Difference]: Finished difference. Result has 126 places, 272 transitions, 3602 flow [2025-04-14 00:54:19,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3602, PETRI_PLACES=126, PETRI_TRANSITIONS=272} [2025-04-14 00:54:19,420 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 90 predicate places. [2025-04-14 00:54:19,421 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 272 transitions, 3602 flow [2025-04-14 00:54:19,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.117647058823529) internal successors, (172), 17 states have internal predecessors, (172), 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 00:54:19,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:19,421 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:19,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:54:19,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:19,621 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:19,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash -203094102, now seen corresponding path program 7 times [2025-04-14 00:54:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:19,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514114775] [2025-04-14 00:54:19,622 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:54:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:19,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:54:19,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:54:19,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:19,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:54:19,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:19,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514114775] [2025-04-14 00:54:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514114775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:54:19,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506526325] [2025-04-14 00:54:19,713 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:54:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:19,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:54:19,716 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 00:54:19,856 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 00:54:19,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:54:19,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:54:19,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:19,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:19,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 00:54:19,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:54:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:19,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:54:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:54:19,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506526325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:54:19,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:54:19,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-04-14 00:54:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608925232] [2025-04-14 00:54:19,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:54:19,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:54:19,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:19,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:54:19,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:54:19,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:19,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 272 transitions, 3602 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 00:54:19,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:19,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:19,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:29,831 INFO L116 PetriNetUnfolderBase]: 71898/105394 cut-off events. [2025-04-14 00:54:29,831 INFO L117 PetriNetUnfolderBase]: For 817399/817399 co-relation queries the response was YES. [2025-04-14 00:54:30,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511169 conditions, 105394 events. 71898/105394 cut-off events. For 817399/817399 co-relation queries the response was YES. Maximal size of possible extension queue 2114. Compared 724436 event pairs, 24196 based on Foata normal form. 890/92407 useless extension candidates. Maximal degree in co-relation 441508. Up to 31913 conditions per place. [2025-04-14 00:54:30,922 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 609 selfloop transitions, 104 changer transitions 10/727 dead transitions. [2025-04-14 00:54:30,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 727 transitions, 10815 flow [2025-04-14 00:54:30,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:54:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:54:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-04-14 00:54:30,923 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2025-04-14 00:54:30,923 INFO L175 Difference]: Start difference. First operand has 126 places, 272 transitions, 3602 flow. Second operand 5 states and 130 transitions. [2025-04-14 00:54:30,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 727 transitions, 10815 flow [2025-04-14 00:54:37,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 727 transitions, 10292 flow, removed 214 selfloop flow, removed 9 redundant places. [2025-04-14 00:54:37,408 INFO L231 Difference]: Finished difference. Result has 122 places, 329 transitions, 4450 flow [2025-04-14 00:54:37,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3364, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4450, PETRI_PLACES=122, PETRI_TRANSITIONS=329} [2025-04-14 00:54:37,408 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 86 predicate places. [2025-04-14 00:54:37,408 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 329 transitions, 4450 flow [2025-04-14 00:54:37,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 00:54:37,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:37,409 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:54:37,414 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 00:54:37,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:37,609 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:37,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1065604016, now seen corresponding path program 2 times [2025-04-14 00:54:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:37,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636253247] [2025-04-14 00:54:37,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:54:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:37,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:54:37,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:54:37,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:54:37,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:37,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636253247] [2025-04-14 00:54:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636253247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:54:37,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382229198] [2025-04-14 00:54:37,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:54:37,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:54:37,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:54:37,678 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 00:54:37,680 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 00:54:37,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:54:37,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:54:37,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:54:37,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:37,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 00:54:37,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:54:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:37,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:54:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:54:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382229198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:54:37,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:54:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-04-14 00:54:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473106117] [2025-04-14 00:54:37,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:54:37,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:54:37,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:37,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:54:37,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:54:37,802 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:54:37,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 329 transitions, 4450 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 00:54:37,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:37,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:54:37,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:59,738 INFO L116 PetriNetUnfolderBase]: 144726/211998 cut-off events. [2025-04-14 00:54:59,739 INFO L117 PetriNetUnfolderBase]: For 1756541/1756541 co-relation queries the response was YES. [2025-04-14 00:55:00,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030106 conditions, 211998 events. 144726/211998 cut-off events. For 1756541/1756541 co-relation queries the response was YES. Maximal size of possible extension queue 4240. Compared 1598089 event pairs, 57485 based on Foata normal form. 2212/186489 useless extension candidates. Maximal degree in co-relation 964828. Up to 63781 conditions per place. [2025-04-14 00:55:01,925 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 690 selfloop transitions, 180 changer transitions 1/875 dead transitions. [2025-04-14 00:55:01,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 875 transitions, 13592 flow [2025-04-14 00:55:01,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:55:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:55:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-04-14 00:55:01,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7294117647058823 [2025-04-14 00:55:01,927 INFO L175 Difference]: Start difference. First operand has 122 places, 329 transitions, 4450 flow. Second operand 5 states and 124 transitions. [2025-04-14 00:55:01,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 875 transitions, 13592 flow [2025-04-14 00:55:13,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 875 transitions, 12557 flow, removed 468 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:13,731 INFO L231 Difference]: Finished difference. Result has 128 places, 432 transitions, 6427 flow [2025-04-14 00:55:13,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4151, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6427, PETRI_PLACES=128, PETRI_TRANSITIONS=432} [2025-04-14 00:55:13,731 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 92 predicate places. [2025-04-14 00:55:13,732 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 432 transitions, 6427 flow [2025-04-14 00:55:13,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 00:55:13,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:13,732 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:55:13,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:55:13,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 00:55:13,932 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:55:13,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1000898121, now seen corresponding path program 8 times [2025-04-14 00:55:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:13,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360705052] [2025-04-14 00:55:13,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:13,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:55:13,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:55:13,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:13,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:55:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:14,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360705052] [2025-04-14 00:55:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360705052] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:14,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203510710] [2025-04-14 00:55:14,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:14,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:14,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:14,065 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 00:55:14,066 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 00:55:14,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:55:14,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:55:14,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:14,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 00:55:14,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:55:14,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:55:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203510710] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:55:14,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:55:14,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 19 [2025-04-14 00:55:14,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509016445] [2025-04-14 00:55:14,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:55:14,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:55:14,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:14,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:55:14,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:55:14,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 00:55:14,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 432 transitions, 6427 flow. Second operand has 20 states, 20 states have (on average 10.3) internal successors, (206), 20 states have internal predecessors, (206), 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 00:55:14,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:14,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 00:55:14,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand