/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:26:51,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:26:51,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:26:51,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:26:51,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:26:51,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:26:51,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:26:51,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:26:51,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:26:51,328 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:26:51,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:26:51,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:26:51,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:26:51,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:26:51,330 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:26:51,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:26:51,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:26:51,330 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:26:51,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:26:51,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:26:51,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:26:51,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:26:51,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:26:51,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:26:51,331 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:26:51,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:26:51,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:26:51,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:26:51,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:26:51,567 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:26:51,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2025-04-14 01:26:52,839 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3853680/cb16614cad714ca8a596e3ada0df6cb2/FLAG232cbc225 [2025-04-14 01:26:53,032 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:26:53,034 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2025-04-14 01:26:53,040 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3853680/cb16614cad714ca8a596e3ada0df6cb2/FLAG232cbc225 [2025-04-14 01:26:53,890 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3853680/cb16614cad714ca8a596e3ada0df6cb2 [2025-04-14 01:26:53,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:26:53,893 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:26:53,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:26:53,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:26:53,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:26:53,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:26:53" (1/1) ... [2025-04-14 01:26:53,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96c98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:53, skipping insertion in model container [2025-04-14 01:26:53,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:26:53" (1/1) ... [2025-04-14 01:26:53,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:26:54,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-04-14 01:26:54,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:26:54,103 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:26:54,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-04-14 01:26:54,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:26:54,140 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:26:54,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54 WrapperNode [2025-04-14 01:26:54,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:26:54,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:26:54,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:26:54,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:26:54,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,169 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2025-04-14 01:26:54,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:26:54,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:26:54,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:26:54,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:26:54,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,187 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 01:26:54,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:26:54,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:26:54,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:26:54,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:26:54,196 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (1/1) ... [2025-04-14 01:26:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:26:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:54,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:26:54,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:26:54,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:26:54,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:26:54,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:26:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:26:54,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:26:54,239 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:26:54,304 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:26:54,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:26:54,459 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:26:54,460 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:26:54,460 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:26:54,574 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:26:54,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:26:54 BoogieIcfgContainer [2025-04-14 01:26:54,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:26:54,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:26:54,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:26:54,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:26:54,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:26:53" (1/3) ... [2025-04-14 01:26:54,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cedfd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:26:54, skipping insertion in model container [2025-04-14 01:26:54,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:54" (2/3) ... [2025-04-14 01:26:54,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cedfd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:26:54, skipping insertion in model container [2025-04-14 01:26:54,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:26:54" (3/3) ... [2025-04-14 01:26:54,582 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2025-04-14 01:26:54,592 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:26:54,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-equiv.wvr.c that has 4 procedures, 29 locations, 28 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 01:26:54,594 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:26:54,638 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:26:54,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 83 flow [2025-04-14 01:26:54,684 INFO L116 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-04-14 01:26:54,686 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:26:54,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-14 01:26:54,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 83 flow [2025-04-14 01:26:54,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 27 transitions, 72 flow [2025-04-14 01:26:54,695 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:26:54,704 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;@2fcdbe8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:26:54,704 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:26:54,716 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:26:54,716 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-14 01:26:54,716 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:26:54,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:54,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:54,717 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 01:26:54,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash -178833497, now seen corresponding path program 1 times [2025-04-14 01:26:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:54,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185274224] [2025-04-14 01:26:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:54,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:26:54,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:26:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:54,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:55,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185274224] [2025-04-14 01:26:55,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185274224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:55,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:26:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290264947] [2025-04-14 01:26:55,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:55,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:26:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:55,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:26:55,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:26:55,150 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-14 01:26:55,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:55,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:55,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-14 01:26:55,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:55,326 INFO L116 PetriNetUnfolderBase]: 510/799 cut-off events. [2025-04-14 01:26:55,326 INFO L117 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-04-14 01:26:55,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 799 events. 510/799 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3378 event pairs, 87 based on Foata normal form. 1/784 useless extension candidates. Maximal degree in co-relation 1433. Up to 573 conditions per place. [2025-04-14 01:26:55,335 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2025-04-14 01:26:55,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 193 flow [2025-04-14 01:26:55,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:26:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:26:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-14 01:26:55,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2025-04-14 01:26:55,347 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 72 flow. Second operand 3 states and 65 transitions. [2025-04-14 01:26:55,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 193 flow [2025-04-14 01:26:55,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 171 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:26:55,353 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 86 flow [2025-04-14 01:26:55,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2025-04-14 01:26:55,357 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-14 01:26:55,357 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 86 flow [2025-04-14 01:26:55,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:55,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:55,357 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] [2025-04-14 01:26:55,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:26:55,357 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 01:26:55,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1576734355, now seen corresponding path program 1 times [2025-04-14 01:26:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:55,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130038233] [2025-04-14 01:26:55,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:55,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:26:55,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:26:55,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:55,637 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 01:26:55,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:55,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130038233] [2025-04-14 01:26:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130038233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:55,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:55,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:26:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753779034] [2025-04-14 01:26:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:55,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:26:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:55,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:26:55,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:26:55,652 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:26:55,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:55,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:55,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:26:55,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:55,962 INFO L116 PetriNetUnfolderBase]: 898/1378 cut-off events. [2025-04-14 01:26:55,963 INFO L117 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-04-14 01:26:55,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 1378 events. 898/1378 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6410 event pairs, 27 based on Foata normal form. 0/1278 useless extension candidates. Maximal degree in co-relation 742. Up to 562 conditions per place. [2025-04-14 01:26:55,971 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 86 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2025-04-14 01:26:55,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 110 transitions, 510 flow [2025-04-14 01:26:55,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:26:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:26:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-04-14 01:26:55,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6733870967741935 [2025-04-14 01:26:55,973 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 86 flow. Second operand 8 states and 167 transitions. [2025-04-14 01:26:55,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 110 transitions, 510 flow [2025-04-14 01:26:55,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 110 transitions, 500 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:26:55,975 INFO L231 Difference]: Finished difference. Result has 43 places, 48 transitions, 226 flow [2025-04-14 01:26:55,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=226, PETRI_PLACES=43, PETRI_TRANSITIONS=48} [2025-04-14 01:26:55,975 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2025-04-14 01:26:55,976 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 48 transitions, 226 flow [2025-04-14 01:26:55,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:55,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:55,976 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] [2025-04-14 01:26:55,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:26:55,976 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 01:26:55,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1099219847, now seen corresponding path program 2 times [2025-04-14 01:26:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:55,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905418909] [2025-04-14 01:26:55,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:55,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:26:56,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:26:56,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:26:56,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:56,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905418909] [2025-04-14 01:26:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905418909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:56,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:56,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:26:56,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752788972] [2025-04-14 01:26:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:56,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:26:56,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:56,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:26:56,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:26:56,143 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:26:56,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 48 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:56,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:56,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:26:56,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:56,337 INFO L116 PetriNetUnfolderBase]: 1068/1614 cut-off events. [2025-04-14 01:26:56,337 INFO L117 PetriNetUnfolderBase]: For 1635/1638 co-relation queries the response was YES. [2025-04-14 01:26:56,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4788 conditions, 1614 events. 1068/1614 cut-off events. For 1635/1638 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7509 event pairs, 144 based on Foata normal form. 36/1644 useless extension candidates. Maximal degree in co-relation 4302. Up to 1134 conditions per place. [2025-04-14 01:26:56,346 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 64 selfloop transitions, 20 changer transitions 2/91 dead transitions. [2025-04-14 01:26:56,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 91 transitions, 578 flow [2025-04-14 01:26:56,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:26:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:26:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-14 01:26:56,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-04-14 01:26:56,348 INFO L175 Difference]: Start difference. First operand has 43 places, 48 transitions, 226 flow. Second operand 6 states and 114 transitions. [2025-04-14 01:26:56,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 91 transitions, 578 flow [2025-04-14 01:26:56,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 91 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:26:56,352 INFO L231 Difference]: Finished difference. Result has 52 places, 59 transitions, 380 flow [2025-04-14 01:26:56,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=52, PETRI_TRANSITIONS=59} [2025-04-14 01:26:56,352 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2025-04-14 01:26:56,352 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 380 flow [2025-04-14 01:26:56,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:56,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:56,353 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] [2025-04-14 01:26:56,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:26:56,353 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 01:26:56,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1877386725, now seen corresponding path program 3 times [2025-04-14 01:26:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:56,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583088802] [2025-04-14 01:26:56,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:26:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:56,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:26:56,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:26:56,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:26:56,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:56,514 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 01:26:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:56,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583088802] [2025-04-14 01:26:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583088802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:56,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:56,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:26:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194092454] [2025-04-14 01:26:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:56,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:26:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:56,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:26:56,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:26:56,524 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-14 01:26:56,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:56,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-14 01:26:56,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:56,859 INFO L116 PetriNetUnfolderBase]: 1825/2680 cut-off events. [2025-04-14 01:26:56,859 INFO L117 PetriNetUnfolderBase]: For 3614/3614 co-relation queries the response was YES. [2025-04-14 01:26:56,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8479 conditions, 2680 events. 1825/2680 cut-off events. For 3614/3614 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13242 event pairs, 167 based on Foata normal form. 42/2720 useless extension candidates. Maximal degree in co-relation 6612. Up to 1116 conditions per place. [2025-04-14 01:26:56,877 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 88 selfloop transitions, 38 changer transitions 2/132 dead transitions. [2025-04-14 01:26:56,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 132 transitions, 921 flow [2025-04-14 01:26:56,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:26:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:26:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2025-04-14 01:26:56,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6491935483870968 [2025-04-14 01:26:56,879 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 380 flow. Second operand 8 states and 161 transitions. [2025-04-14 01:26:56,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 132 transitions, 921 flow [2025-04-14 01:26:56,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 132 transitions, 877 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 01:26:56,890 INFO L231 Difference]: Finished difference. Result has 62 places, 73 transitions, 610 flow [2025-04-14 01:26:56,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=610, PETRI_PLACES=62, PETRI_TRANSITIONS=73} [2025-04-14 01:26:56,891 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2025-04-14 01:26:56,891 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 610 flow [2025-04-14 01:26:56,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:56,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:56,891 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] [2025-04-14 01:26:56,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:26:56,891 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 01:26:56,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash -65953515, now seen corresponding path program 4 times [2025-04-14 01:26:56,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:56,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032730328] [2025-04-14 01:26:56,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:26:56,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:56,897 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:26:56,904 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:26:56,905 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:26:56,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:57,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:57,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032730328] [2025-04-14 01:26:57,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032730328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:57,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:57,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:26:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626766437] [2025-04-14 01:26:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:57,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:26:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:57,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:26:57,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:26:57,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-14 01:26:57,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 73 transitions, 610 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:57,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:57,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-14 01:26:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:57,530 INFO L116 PetriNetUnfolderBase]: 1708/2753 cut-off events. [2025-04-14 01:26:57,530 INFO L117 PetriNetUnfolderBase]: For 6970/7181 co-relation queries the response was YES. [2025-04-14 01:26:57,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9695 conditions, 2753 events. 1708/2753 cut-off events. For 6970/7181 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 15838 event pairs, 143 based on Foata normal form. 43/2761 useless extension candidates. Maximal degree in co-relation 7316. Up to 1831 conditions per place. [2025-04-14 01:26:57,546 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 102 selfloop transitions, 46 changer transitions 2/160 dead transitions. [2025-04-14 01:26:57,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 160 transitions, 1277 flow [2025-04-14 01:26:57,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:26:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:26:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 218 transitions. [2025-04-14 01:26:57,548 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2025-04-14 01:26:57,548 INFO L175 Difference]: Start difference. First operand has 62 places, 73 transitions, 610 flow. Second operand 12 states and 218 transitions. [2025-04-14 01:26:57,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 160 transitions, 1277 flow [2025-04-14 01:26:57,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 160 transitions, 1256 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-14 01:26:57,560 INFO L231 Difference]: Finished difference. Result has 79 places, 104 transitions, 945 flow [2025-04-14 01:26:57,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=945, PETRI_PLACES=79, PETRI_TRANSITIONS=104} [2025-04-14 01:26:57,561 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2025-04-14 01:26:57,561 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 104 transitions, 945 flow [2025-04-14 01:26:57,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:57,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:57,561 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] [2025-04-14 01:26:57,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:26:57,562 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 01:26:57,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:57,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1936859325, now seen corresponding path program 1 times [2025-04-14 01:26:57,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:57,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504858087] [2025-04-14 01:26:57,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:57,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:26:57,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:26:57,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:57,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:57,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504858087] [2025-04-14 01:26:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504858087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:57,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:26:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157664201] [2025-04-14 01:26:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:57,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:26:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:57,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:26:57,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:26:57,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-04-14 01:26:57,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 104 transitions, 945 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:57,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:57,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-04-14 01:26:57,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:58,531 INFO L116 PetriNetUnfolderBase]: 3892/5728 cut-off events. [2025-04-14 01:26:58,531 INFO L117 PetriNetUnfolderBase]: For 23086/23086 co-relation queries the response was YES. [2025-04-14 01:26:58,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23495 conditions, 5728 events. 3892/5728 cut-off events. For 23086/23086 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 31074 event pairs, 454 based on Foata normal form. 125/5437 useless extension candidates. Maximal degree in co-relation 21277. Up to 3021 conditions per place. [2025-04-14 01:26:58,565 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 155 selfloop transitions, 58 changer transitions 5/221 dead transitions. [2025-04-14 01:26:58,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 221 transitions, 2137 flow [2025-04-14 01:26:58,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:26:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:26:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2025-04-14 01:26:58,567 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5870967741935483 [2025-04-14 01:26:58,567 INFO L175 Difference]: Start difference. First operand has 79 places, 104 transitions, 945 flow. Second operand 10 states and 182 transitions. [2025-04-14 01:26:58,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 221 transitions, 2137 flow [2025-04-14 01:26:58,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 221 transitions, 1988 flow, removed 57 selfloop flow, removed 1 redundant places. [2025-04-14 01:26:58,621 INFO L231 Difference]: Finished difference. Result has 95 places, 132 transitions, 1423 flow [2025-04-14 01:26:58,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1423, PETRI_PLACES=95, PETRI_TRANSITIONS=132} [2025-04-14 01:26:58,622 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places. [2025-04-14 01:26:58,622 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 132 transitions, 1423 flow [2025-04-14 01:26:58,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:58,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:58,622 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] [2025-04-14 01:26:58,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:26:58,623 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 01:26:58,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:58,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1670312241, now seen corresponding path program 2 times [2025-04-14 01:26:58,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:58,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184790965] [2025-04-14 01:26:58,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:58,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:58,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:26:58,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:26:58,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:58,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:58,891 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 01:26:58,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:58,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184790965] [2025-04-14 01:26:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184790965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:26:58,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632199700] [2025-04-14 01:26:58,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:58,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:26:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:58,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:26:58,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:26:58,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:26:58,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 132 transitions, 1423 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:58,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:58,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:26:58,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:59,436 INFO L116 PetriNetUnfolderBase]: 2785/4441 cut-off events. [2025-04-14 01:26:59,436 INFO L117 PetriNetUnfolderBase]: For 22865/23006 co-relation queries the response was YES. [2025-04-14 01:26:59,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19907 conditions, 4441 events. 2785/4441 cut-off events. For 22865/23006 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 26630 event pairs, 399 based on Foata normal form. 34/4443 useless extension candidates. Maximal degree in co-relation 17951. Up to 3605 conditions per place. [2025-04-14 01:26:59,472 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 118 selfloop transitions, 61 changer transitions 0/193 dead transitions. [2025-04-14 01:26:59,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 193 transitions, 2240 flow [2025-04-14 01:26:59,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:26:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:26:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-04-14 01:26:59,474 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.592741935483871 [2025-04-14 01:26:59,474 INFO L175 Difference]: Start difference. First operand has 95 places, 132 transitions, 1423 flow. Second operand 8 states and 147 transitions. [2025-04-14 01:26:59,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 193 transitions, 2240 flow [2025-04-14 01:26:59,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 193 transitions, 2230 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-04-14 01:26:59,531 INFO L231 Difference]: Finished difference. Result has 107 places, 151 transitions, 1915 flow [2025-04-14 01:26:59,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1915, PETRI_PLACES=107, PETRI_TRANSITIONS=151} [2025-04-14 01:26:59,532 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 73 predicate places. [2025-04-14 01:26:59,532 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 151 transitions, 1915 flow [2025-04-14 01:26:59,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:59,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:59,532 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] [2025-04-14 01:26:59,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:26:59,533 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 01:26:59,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash 219519789, now seen corresponding path program 1 times [2025-04-14 01:26:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:59,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915473156] [2025-04-14 01:26:59,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:59,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:26:59,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:26:59,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:59,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:59,681 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 01:26:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:59,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915473156] [2025-04-14 01:26:59,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915473156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:59,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:26:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656107325] [2025-04-14 01:26:59,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:59,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:26:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:59,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:26:59,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:26:59,690 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:26:59,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 151 transitions, 1915 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:59,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:59,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:26:59,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:00,179 INFO L116 PetriNetUnfolderBase]: 3329/5400 cut-off events. [2025-04-14 01:27:00,179 INFO L117 PetriNetUnfolderBase]: For 38792/39120 co-relation queries the response was YES. [2025-04-14 01:27:00,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26081 conditions, 5400 events. 3329/5400 cut-off events. For 38792/39120 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 34685 event pairs, 961 based on Foata normal form. 86/5436 useless extension candidates. Maximal degree in co-relation 23684. Up to 2915 conditions per place. [2025-04-14 01:27:00,215 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 113 selfloop transitions, 72 changer transitions 3/204 dead transitions. [2025-04-14 01:27:00,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 204 transitions, 2641 flow [2025-04-14 01:27:00,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:27:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:27:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-14 01:27:00,216 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-14 01:27:00,216 INFO L175 Difference]: Start difference. First operand has 107 places, 151 transitions, 1915 flow. Second operand 5 states and 103 transitions. [2025-04-14 01:27:00,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 204 transitions, 2641 flow [2025-04-14 01:27:00,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 204 transitions, 2543 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-04-14 01:27:00,308 INFO L231 Difference]: Finished difference. Result has 112 places, 159 transitions, 2141 flow [2025-04-14 01:27:00,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2141, PETRI_PLACES=112, PETRI_TRANSITIONS=159} [2025-04-14 01:27:00,309 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 78 predicate places. [2025-04-14 01:27:00,309 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 159 transitions, 2141 flow [2025-04-14 01:27:00,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:00,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:00,309 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] [2025-04-14 01:27:00,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:27:00,309 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 01:27:00,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1688670413, now seen corresponding path program 2 times [2025-04-14 01:27:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:00,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720752142] [2025-04-14 01:27:00,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:27:00,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:00,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:27:00,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:00,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:27:00,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:00,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720752142] [2025-04-14 01:27:00,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720752142] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:00,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:00,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:27:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449328576] [2025-04-14 01:27:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:00,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:27:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:00,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:27:00,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:27:00,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-14 01:27:00,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 159 transitions, 2141 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:00,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:00,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-14 01:27:00,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:01,363 INFO L116 PetriNetUnfolderBase]: 5904/9184 cut-off events. [2025-04-14 01:27:01,363 INFO L117 PetriNetUnfolderBase]: For 81126/81711 co-relation queries the response was YES. [2025-04-14 01:27:01,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46537 conditions, 9184 events. 5904/9184 cut-off events. For 81126/81711 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 59503 event pairs, 1223 based on Foata normal form. 206/9346 useless extension candidates. Maximal degree in co-relation 41479. Up to 2804 conditions per place. [2025-04-14 01:27:01,428 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 175 selfloop transitions, 123 changer transitions 1/311 dead transitions. [2025-04-14 01:27:01,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 311 transitions, 4115 flow [2025-04-14 01:27:01,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:27:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:27:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-04-14 01:27:01,430 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6820276497695853 [2025-04-14 01:27:01,430 INFO L175 Difference]: Start difference. First operand has 112 places, 159 transitions, 2141 flow. Second operand 7 states and 148 transitions. [2025-04-14 01:27:01,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 311 transitions, 4115 flow [2025-04-14 01:27:01,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 311 transitions, 3979 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-04-14 01:27:01,659 INFO L231 Difference]: Finished difference. Result has 122 places, 206 transitions, 2984 flow [2025-04-14 01:27:01,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2984, PETRI_PLACES=122, PETRI_TRANSITIONS=206} [2025-04-14 01:27:01,660 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 88 predicate places. [2025-04-14 01:27:01,660 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 206 transitions, 2984 flow [2025-04-14 01:27:01,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:01,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:01,660 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] [2025-04-14 01:27:01,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:27:01,660 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 01:27:01,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash 579250791, now seen corresponding path program 3 times [2025-04-14 01:27:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:01,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420410542] [2025-04-14 01:27:01,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:27:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:01,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:27:01,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:01,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:27:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:01,823 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 01:27:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:01,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420410542] [2025-04-14 01:27:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420410542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:01,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:01,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:27:01,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620026562] [2025-04-14 01:27:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:01,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:27:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:27:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:27:01,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-14 01:27:01,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 206 transitions, 2984 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:01,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:01,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-14 01:27:01,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:02,785 INFO L116 PetriNetUnfolderBase]: 5981/9232 cut-off events. [2025-04-14 01:27:02,785 INFO L117 PetriNetUnfolderBase]: For 88218/88761 co-relation queries the response was YES. [2025-04-14 01:27:02,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52491 conditions, 9232 events. 5981/9232 cut-off events. For 88218/88761 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 59144 event pairs, 1728 based on Foata normal form. 79/9256 useless extension candidates. Maximal degree in co-relation 46768. Up to 5317 conditions per place. [2025-04-14 01:27:02,836 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 130 selfloop transitions, 120 changer transitions 6/268 dead transitions. [2025-04-14 01:27:02,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 268 transitions, 4036 flow [2025-04-14 01:27:02,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:27:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:27:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-04-14 01:27:02,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6903225806451613 [2025-04-14 01:27:02,838 INFO L175 Difference]: Start difference. First operand has 122 places, 206 transitions, 2984 flow. Second operand 5 states and 107 transitions. [2025-04-14 01:27:02,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 268 transitions, 4036 flow [2025-04-14 01:27:03,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 268 transitions, 4008 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-04-14 01:27:03,100 INFO L231 Difference]: Finished difference. Result has 129 places, 210 transitions, 3422 flow [2025-04-14 01:27:03,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2912, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3422, PETRI_PLACES=129, PETRI_TRANSITIONS=210} [2025-04-14 01:27:03,101 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 95 predicate places. [2025-04-14 01:27:03,101 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 210 transitions, 3422 flow [2025-04-14 01:27:03,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:03,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:03,101 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] [2025-04-14 01:27:03,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:27:03,101 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 01:27:03,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash 878519281, now seen corresponding path program 3 times [2025-04-14 01:27:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:03,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528679955] [2025-04-14 01:27:03,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:27:03,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:03,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:27:03,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:03,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:27:03,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:03,181 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 01:27:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:03,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528679955] [2025-04-14 01:27:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528679955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:27:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531705856] [2025-04-14 01:27:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:03,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:27:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:03,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:27:03,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:27:03,187 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:03,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 210 transitions, 3422 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:03,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:03,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:03,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:03,904 INFO L116 PetriNetUnfolderBase]: 4723/7531 cut-off events. [2025-04-14 01:27:03,904 INFO L117 PetriNetUnfolderBase]: For 82374/82757 co-relation queries the response was YES. [2025-04-14 01:27:03,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44871 conditions, 7531 events. 4723/7531 cut-off events. For 82374/82757 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 49089 event pairs, 862 based on Foata normal form. 109/7555 useless extension candidates. Maximal degree in co-relation 39713. Up to 6476 conditions per place. [2025-04-14 01:27:03,956 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 183 selfloop transitions, 47 changer transitions 6/251 dead transitions. [2025-04-14 01:27:03,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 251 transitions, 4198 flow [2025-04-14 01:27:03,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:27:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:27:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-14 01:27:03,957 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2025-04-14 01:27:03,957 INFO L175 Difference]: Start difference. First operand has 129 places, 210 transitions, 3422 flow. Second operand 5 states and 100 transitions. [2025-04-14 01:27:03,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 251 transitions, 4198 flow [2025-04-14 01:27:04,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 251 transitions, 4080 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-14 01:27:04,228 INFO L231 Difference]: Finished difference. Result has 132 places, 205 transitions, 3314 flow [2025-04-14 01:27:04,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3178, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3314, PETRI_PLACES=132, PETRI_TRANSITIONS=205} [2025-04-14 01:27:04,228 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 98 predicate places. [2025-04-14 01:27:04,228 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 205 transitions, 3314 flow [2025-04-14 01:27:04,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:04,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:04,229 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] [2025-04-14 01:27:04,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:27:04,229 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 01:27:04,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash -454548219, now seen corresponding path program 4 times [2025-04-14 01:27:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:04,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371397036] [2025-04-14 01:27:04,229 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:27:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:04,234 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:27:04,238 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:04,238 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:27:04,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:04,365 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 01:27:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:04,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371397036] [2025-04-14 01:27:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371397036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:27:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777916371] [2025-04-14 01:27:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:04,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:27:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:04,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:27:04,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:27:04,374 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:04,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 205 transitions, 3314 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:04,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:04,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:04,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:05,472 INFO L116 PetriNetUnfolderBase]: 5749/9112 cut-off events. [2025-04-14 01:27:05,472 INFO L117 PetriNetUnfolderBase]: For 109728/110485 co-relation queries the response was YES. [2025-04-14 01:27:05,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55045 conditions, 9112 events. 5749/9112 cut-off events. For 109728/110485 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 61773 event pairs, 827 based on Foata normal form. 187/9135 useless extension candidates. Maximal degree in co-relation 49092. Up to 3614 conditions per place. [2025-04-14 01:27:05,558 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 171 selfloop transitions, 118 changer transitions 1/310 dead transitions. [2025-04-14 01:27:05,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 310 transitions, 5128 flow [2025-04-14 01:27:05,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:27:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:27:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 01:27:05,559 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-14 01:27:05,559 INFO L175 Difference]: Start difference. First operand has 132 places, 205 transitions, 3314 flow. Second operand 5 states and 101 transitions. [2025-04-14 01:27:05,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 310 transitions, 5128 flow [2025-04-14 01:27:05,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 310 transitions, 5050 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 01:27:05,877 INFO L231 Difference]: Finished difference. Result has 137 places, 253 transitions, 4531 flow [2025-04-14 01:27:05,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3243, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4531, PETRI_PLACES=137, PETRI_TRANSITIONS=253} [2025-04-14 01:27:05,878 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 103 predicate places. [2025-04-14 01:27:05,878 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 253 transitions, 4531 flow [2025-04-14 01:27:05,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:05,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:05,878 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] [2025-04-14 01:27:05,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:27:05,879 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 01:27:05,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 607868489, now seen corresponding path program 5 times [2025-04-14 01:27:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:05,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174237663] [2025-04-14 01:27:05,879 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:27:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:05,885 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:27:05,890 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:05,890 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:27:05,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:05,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174237663] [2025-04-14 01:27:05,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174237663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:27:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513847243] [2025-04-14 01:27:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:05,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:27:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:05,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:27:05,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:27:06,003 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:06,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 253 transitions, 4531 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:06,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:06,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:06,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:07,403 INFO L116 PetriNetUnfolderBase]: 8579/13300 cut-off events. [2025-04-14 01:27:07,403 INFO L117 PetriNetUnfolderBase]: For 200135/201097 co-relation queries the response was YES. [2025-04-14 01:27:07,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88277 conditions, 13300 events. 8579/13300 cut-off events. For 200135/201097 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 91876 event pairs, 1104 based on Foata normal form. 395/13526 useless extension candidates. Maximal degree in co-relation 81497. Up to 4111 conditions per place. [2025-04-14 01:27:07,520 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 281 selfloop transitions, 250 changer transitions 8/559 dead transitions. [2025-04-14 01:27:07,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 559 transitions, 10706 flow [2025-04-14 01:27:07,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:27:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:27:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2025-04-14 01:27:07,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-04-14 01:27:07,521 INFO L175 Difference]: Start difference. First operand has 137 places, 253 transitions, 4531 flow. Second operand 9 states and 168 transitions. [2025-04-14 01:27:07,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 559 transitions, 10706 flow [2025-04-14 01:27:08,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 559 transitions, 10706 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:27:08,048 INFO L231 Difference]: Finished difference. Result has 152 places, 416 transitions, 8929 flow [2025-04-14 01:27:08,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4531, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8929, PETRI_PLACES=152, PETRI_TRANSITIONS=416} [2025-04-14 01:27:08,048 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 118 predicate places. [2025-04-14 01:27:08,049 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 416 transitions, 8929 flow [2025-04-14 01:27:08,049 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:08,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:08,049 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] [2025-04-14 01:27:08,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:27:08,049 INFO L403 AbstractCegarLoop]: === Iteration 14 === 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 01:27:08,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 614648235, now seen corresponding path program 6 times [2025-04-14 01:27:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:08,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175939307] [2025-04-14 01:27:08,049 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:27:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:08,053 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:27:08,057 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:08,057 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:27:08,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:08,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175939307] [2025-04-14 01:27:08,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175939307] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:08,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:08,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:27:08,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769082781] [2025-04-14 01:27:08,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:08,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:27:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:08,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:27:08,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:27:08,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-14 01:27:08,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 416 transitions, 8929 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:08,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:08,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-14 01:27:08,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:10,181 INFO L116 PetriNetUnfolderBase]: 10991/16469 cut-off events. [2025-04-14 01:27:10,181 INFO L117 PetriNetUnfolderBase]: For 290323/291395 co-relation queries the response was YES. [2025-04-14 01:27:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121517 conditions, 16469 events. 10991/16469 cut-off events. For 290323/291395 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 108718 event pairs, 1088 based on Foata normal form. 210/16604 useless extension candidates. Maximal degree in co-relation 113198. Up to 5004 conditions per place. [2025-04-14 01:27:10,304 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 225 selfloop transitions, 317 changer transitions 9/563 dead transitions. [2025-04-14 01:27:10,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 563 transitions, 12157 flow [2025-04-14 01:27:10,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:27:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:27:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-04-14 01:27:10,305 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6405529953917051 [2025-04-14 01:27:10,305 INFO L175 Difference]: Start difference. First operand has 152 places, 416 transitions, 8929 flow. Second operand 7 states and 139 transitions. [2025-04-14 01:27:10,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 563 transitions, 12157 flow [2025-04-14 01:27:11,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 563 transitions, 11694 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-04-14 01:27:11,130 INFO L231 Difference]: Finished difference. Result has 156 places, 459 transitions, 10558 flow [2025-04-14 01:27:11,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=8371, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10558, PETRI_PLACES=156, PETRI_TRANSITIONS=459} [2025-04-14 01:27:11,131 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 122 predicate places. [2025-04-14 01:27:11,131 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 459 transitions, 10558 flow [2025-04-14 01:27:11,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:11,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:11,131 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] [2025-04-14 01:27:11,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 01:27:11,131 INFO L403 AbstractCegarLoop]: === Iteration 15 === 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 01:27:11,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1820606269, now seen corresponding path program 7 times [2025-04-14 01:27:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:11,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119598370] [2025-04-14 01:27:11,132 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:27:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:11,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:27:11,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:11,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:27:11,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:11,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119598370] [2025-04-14 01:27:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119598370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:27:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404085975] [2025-04-14 01:27:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:11,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:27:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:11,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:27:11,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:27:11,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:11,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 459 transitions, 10558 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:11,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:11,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:11,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:13,258 INFO L116 PetriNetUnfolderBase]: 10117/15588 cut-off events. [2025-04-14 01:27:13,258 INFO L117 PetriNetUnfolderBase]: For 283973/284613 co-relation queries the response was YES. [2025-04-14 01:27:13,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118238 conditions, 15588 events. 10117/15588 cut-off events. For 283973/284613 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 106439 event pairs, 1297 based on Foata normal form. 141/15636 useless extension candidates. Maximal degree in co-relation 111056. Up to 14251 conditions per place. [2025-04-14 01:27:13,383 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 397 selfloop transitions, 64 changer transitions 2/486 dead transitions. [2025-04-14 01:27:13,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 486 transitions, 11748 flow [2025-04-14 01:27:13,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:27:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:27:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-04-14 01:27:13,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-14 01:27:13,384 INFO L175 Difference]: Start difference. First operand has 156 places, 459 transitions, 10558 flow. Second operand 5 states and 93 transitions. [2025-04-14 01:27:13,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 486 transitions, 11748 flow [2025-04-14 01:27:14,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 486 transitions, 11178 flow, removed 47 selfloop flow, removed 8 redundant places. [2025-04-14 01:27:14,154 INFO L231 Difference]: Finished difference. Result has 153 places, 462 transitions, 10207 flow [2025-04-14 01:27:14,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=10006, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10207, PETRI_PLACES=153, PETRI_TRANSITIONS=462} [2025-04-14 01:27:14,155 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 119 predicate places. [2025-04-14 01:27:14,155 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 462 transitions, 10207 flow [2025-04-14 01:27:14,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:14,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:14,155 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] [2025-04-14 01:27:14,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:27:14,155 INFO L403 AbstractCegarLoop]: === Iteration 16 === 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 01:27:14,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2035990085, now seen corresponding path program 8 times [2025-04-14 01:27:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:14,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375733316] [2025-04-14 01:27:14,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:27:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:14,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:27:14,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:14,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:27:14,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:14,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375733316] [2025-04-14 01:27:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375733316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:27:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25325718] [2025-04-14 01:27:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:14,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:27:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:14,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:27:14,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:27:14,237 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:14,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 462 transitions, 10207 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:14,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:14,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:14,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:16,667 INFO L116 PetriNetUnfolderBase]: 11577/18051 cut-off events. [2025-04-14 01:27:16,668 INFO L117 PetriNetUnfolderBase]: For 293867/294569 co-relation queries the response was YES. [2025-04-14 01:27:16,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132471 conditions, 18051 events. 11577/18051 cut-off events. For 293867/294569 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 127512 event pairs, 1152 based on Foata normal form. 510/18471 useless extension candidates. Maximal degree in co-relation 126834. Up to 11652 conditions per place. [2025-04-14 01:27:16,817 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 475 selfloop transitions, 82 changer transitions 1/581 dead transitions. [2025-04-14 01:27:16,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 581 transitions, 13413 flow [2025-04-14 01:27:16,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:27:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:27:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-14 01:27:16,818 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-04-14 01:27:16,818 INFO L175 Difference]: Start difference. First operand has 153 places, 462 transitions, 10207 flow. Second operand 6 states and 114 transitions. [2025-04-14 01:27:16,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 581 transitions, 13413 flow [2025-04-14 01:27:17,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 581 transitions, 13183 flow, removed 30 selfloop flow, removed 3 redundant places. [2025-04-14 01:27:17,680 INFO L231 Difference]: Finished difference. Result has 158 places, 474 transitions, 10497 flow [2025-04-14 01:27:17,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=10000, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10497, PETRI_PLACES=158, PETRI_TRANSITIONS=474} [2025-04-14 01:27:17,680 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 124 predicate places. [2025-04-14 01:27:17,681 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 474 transitions, 10497 flow [2025-04-14 01:27:17,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:17,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:17,681 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] [2025-04-14 01:27:17,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:27:17,681 INFO L403 AbstractCegarLoop]: === Iteration 17 === 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 01:27:17,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash -199507933, now seen corresponding path program 9 times [2025-04-14 01:27:17,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:17,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713014433] [2025-04-14 01:27:17,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:27:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:17,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:27:17,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:27:17,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:27:17,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:17,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:17,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713014433] [2025-04-14 01:27:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713014433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:27:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407284812] [2025-04-14 01:27:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:17,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:27:17,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:17,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:27:17,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:27:17,893 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:17,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 474 transitions, 10497 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:17,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:17,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:17,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:20,291 INFO L116 PetriNetUnfolderBase]: 11846/18401 cut-off events. [2025-04-14 01:27:20,292 INFO L117 PetriNetUnfolderBase]: For 313184/314025 co-relation queries the response was YES. [2025-04-14 01:27:20,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138586 conditions, 18401 events. 11846/18401 cut-off events. For 313184/314025 co-relation queries the response was YES. Maximal size of possible extension queue 1156. Compared 130212 event pairs, 1464 based on Foata normal form. 227/18532 useless extension candidates. Maximal degree in co-relation 133026. Up to 16498 conditions per place. [2025-04-14 01:27:20,438 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 440 selfloop transitions, 90 changer transitions 4/557 dead transitions. [2025-04-14 01:27:20,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 557 transitions, 12982 flow [2025-04-14 01:27:20,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:27:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:27:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-14 01:27:20,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-04-14 01:27:20,439 INFO L175 Difference]: Start difference. First operand has 158 places, 474 transitions, 10497 flow. Second operand 6 states and 112 transitions. [2025-04-14 01:27:20,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 557 transitions, 12982 flow [2025-04-14 01:27:21,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 557 transitions, 12871 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-04-14 01:27:21,450 INFO L231 Difference]: Finished difference. Result has 158 places, 483 transitions, 10917 flow [2025-04-14 01:27:21,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=10271, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10917, PETRI_PLACES=158, PETRI_TRANSITIONS=483} [2025-04-14 01:27:21,451 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 124 predicate places. [2025-04-14 01:27:21,451 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 483 transitions, 10917 flow [2025-04-14 01:27:21,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:21,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:21,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:27:21,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:27:21,451 INFO L403 AbstractCegarLoop]: === Iteration 18 === 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 01:27:21,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1667044589, now seen corresponding path program 5 times [2025-04-14 01:27:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:21,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519227772] [2025-04-14 01:27:21,452 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:27:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:21,456 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:27:21,462 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:27:21,462 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:27:21,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:21,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519227772] [2025-04-14 01:27:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519227772] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:21,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:21,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:27:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181705144] [2025-04-14 01:27:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:21,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:27:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:21,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:27:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:27:21,535 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:21,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 483 transitions, 10917 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:21,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:21,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:21,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:24,368 INFO L116 PetriNetUnfolderBase]: 13627/20918 cut-off events. [2025-04-14 01:27:24,368 INFO L117 PetriNetUnfolderBase]: For 351702/352282 co-relation queries the response was YES. [2025-04-14 01:27:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155687 conditions, 20918 events. 13627/20918 cut-off events. For 351702/352282 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 148244 event pairs, 1811 based on Foata normal form. 377/21203 useless extension candidates. Maximal degree in co-relation 151157. Up to 12278 conditions per place. [2025-04-14 01:27:24,844 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 306 selfloop transitions, 296 changer transitions 0/625 dead transitions. [2025-04-14 01:27:24,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 625 transitions, 14776 flow [2025-04-14 01:27:24,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:27:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:27:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-04-14 01:27:24,845 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2025-04-14 01:27:24,845 INFO L175 Difference]: Start difference. First operand has 158 places, 483 transitions, 10917 flow. Second operand 6 states and 109 transitions. [2025-04-14 01:27:24,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 625 transitions, 14776 flow [2025-04-14 01:27:25,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 625 transitions, 14584 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-04-14 01:27:25,982 INFO L231 Difference]: Finished difference. Result has 154 places, 561 transitions, 13665 flow [2025-04-14 01:27:25,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=10682, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13665, PETRI_PLACES=154, PETRI_TRANSITIONS=561} [2025-04-14 01:27:25,983 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 120 predicate places. [2025-04-14 01:27:25,983 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 561 transitions, 13665 flow [2025-04-14 01:27:25,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:25,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:25,983 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, 1] [2025-04-14 01:27:25,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:27:25,983 INFO L403 AbstractCegarLoop]: === Iteration 19 === 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 01:27:25,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -549311809, now seen corresponding path program 1 times [2025-04-14 01:27:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:25,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77463361] [2025-04-14 01:27:25,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:27:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:25,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:27:25,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:27:25,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:27:25,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:26,109 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 01:27:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:26,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77463361] [2025-04-14 01:27:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77463361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:27:26,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239235436] [2025-04-14 01:27:26,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:27:26,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:26,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:27:26,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:27:26,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:27:26,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:27:26,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:27:26,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:27:26,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:26,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:27:26,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:27:26,481 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 01:27:26,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:27:26,793 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 01:27:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239235436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:27:26,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:27:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-04-14 01:27:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695145391] [2025-04-14 01:27:26,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:27:26,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:27:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:26,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:27:26,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:27:26,808 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-14 01:27:26,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 561 transitions, 13665 flow. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:26,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:26,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-14 01:27:26,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:33,066 INFO L116 PetriNetUnfolderBase]: 27848/42279 cut-off events. [2025-04-14 01:27:33,066 INFO L117 PetriNetUnfolderBase]: For 745156/745558 co-relation queries the response was YES. [2025-04-14 01:27:33,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318662 conditions, 42279 events. 27848/42279 cut-off events. For 745156/745558 co-relation queries the response was YES. Maximal size of possible extension queue 2558. Compared 321714 event pairs, 1460 based on Foata normal form. 96/42306 useless extension candidates. Maximal degree in co-relation 306431. Up to 19841 conditions per place. [2025-04-14 01:27:33,708 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 1042 selfloop transitions, 552 changer transitions 10/1616 dead transitions. [2025-04-14 01:27:33,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1616 transitions, 39447 flow [2025-04-14 01:27:33,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:27:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:27:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 295 transitions. [2025-04-14 01:27:33,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2025-04-14 01:27:33,710 INFO L175 Difference]: Start difference. First operand has 154 places, 561 transitions, 13665 flow. Second operand 15 states and 295 transitions. [2025-04-14 01:27:33,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1616 transitions, 39447 flow [2025-04-14 01:27:36,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 1616 transitions, 39338 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-04-14 01:27:36,610 INFO L231 Difference]: Finished difference. Result has 172 places, 950 transitions, 23003 flow [2025-04-14 01:27:36,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=13618, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=23003, PETRI_PLACES=172, PETRI_TRANSITIONS=950} [2025-04-14 01:27:36,611 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 138 predicate places. [2025-04-14 01:27:36,611 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 950 transitions, 23003 flow [2025-04-14 01:27:36,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:36,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:36,611 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, 1] [2025-04-14 01:27:36,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:27:36,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:36,812 INFO L403 AbstractCegarLoop]: === Iteration 20 === 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 01:27:36,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1514163137, now seen corresponding path program 2 times [2025-04-14 01:27:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:36,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135181208] [2025-04-14 01:27:36,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:27:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:36,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:27:36,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:27:36,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:27:36,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:36,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:36,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135181208] [2025-04-14 01:27:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135181208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:36,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:36,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:27:36,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450465990] [2025-04-14 01:27:36,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:36,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:27:36,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:36,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:27:36,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:27:36,938 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 01:27:36,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 950 transitions, 23003 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:36,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:36,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 01:27:36,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:44,027 INFO L116 PetriNetUnfolderBase]: 26578/41217 cut-off events. [2025-04-14 01:27:44,028 INFO L117 PetriNetUnfolderBase]: For 873589/875145 co-relation queries the response was YES. [2025-04-14 01:27:44,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342735 conditions, 41217 events. 26578/41217 cut-off events. For 873589/875145 co-relation queries the response was YES. Maximal size of possible extension queue 2701. Compared 324384 event pairs, 3849 based on Foata normal form. 606/41681 useless extension candidates. Maximal degree in co-relation 334780. Up to 34253 conditions per place. [2025-04-14 01:27:44,495 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 760 selfloop transitions, 291 changer transitions 1/1076 dead transitions. [2025-04-14 01:27:44,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1076 transitions, 27686 flow [2025-04-14 01:27:44,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:27:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:27:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-04-14 01:27:44,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2025-04-14 01:27:44,496 INFO L175 Difference]: Start difference. First operand has 172 places, 950 transitions, 23003 flow. Second operand 6 states and 111 transitions. [2025-04-14 01:27:44,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1076 transitions, 27686 flow [2025-04-14 01:27:48,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 1076 transitions, 26425 flow, removed 538 selfloop flow, removed 4 redundant places. [2025-04-14 01:27:48,778 INFO L231 Difference]: Finished difference. Result has 174 places, 1020 transitions, 24169 flow [2025-04-14 01:27:48,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=21866, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24169, PETRI_PLACES=174, PETRI_TRANSITIONS=1020} [2025-04-14 01:27:48,779 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 140 predicate places. [2025-04-14 01:27:48,779 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 1020 transitions, 24169 flow [2025-04-14 01:27:48,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:48,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:48,779 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, 1] [2025-04-14 01:27:48,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 01:27:48,779 INFO L403 AbstractCegarLoop]: === Iteration 21 === 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 01:27:48,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash 635923967, now seen corresponding path program 1 times [2025-04-14 01:27:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:48,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120910083] [2025-04-14 01:27:48,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:27:48,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:48,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:27:48,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:27:48,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:27:48,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:48,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:48,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120910083] [2025-04-14 01:27:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120910083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:48,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:48,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:27:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969286240] [2025-04-14 01:27:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:48,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:27:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:48,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:27:48,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:27:48,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-14 01:27:48,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 1020 transitions, 24169 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:48,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:48,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-14 01:27:48,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:57,576 INFO L116 PetriNetUnfolderBase]: 31492/47235 cut-off events. [2025-04-14 01:27:57,576 INFO L117 PetriNetUnfolderBase]: For 905769/906577 co-relation queries the response was YES. [2025-04-14 01:27:57,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377692 conditions, 47235 events. 31492/47235 cut-off events. For 905769/906577 co-relation queries the response was YES. Maximal size of possible extension queue 2871. Compared 354820 event pairs, 3380 based on Foata normal form. 1686/48762 useless extension candidates. Maximal degree in co-relation 377479. Up to 20855 conditions per place. [2025-04-14 01:27:58,083 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1292 selfloop transitions, 138 changer transitions 0/1445 dead transitions. [2025-04-14 01:27:58,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1445 transitions, 36019 flow [2025-04-14 01:27:58,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:27:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:27:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2025-04-14 01:27:58,084 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5412186379928315 [2025-04-14 01:27:58,084 INFO L175 Difference]: Start difference. First operand has 174 places, 1020 transitions, 24169 flow. Second operand 9 states and 151 transitions. [2025-04-14 01:27:58,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1445 transitions, 36019 flow [2025-04-14 01:28:02,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1445 transitions, 35535 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-14 01:28:02,534 INFO L231 Difference]: Finished difference. Result has 178 places, 997 transitions, 23514 flow [2025-04-14 01:28:02,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=22911, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=983, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=23514, PETRI_PLACES=178, PETRI_TRANSITIONS=997} [2025-04-14 01:28:02,535 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 144 predicate places. [2025-04-14 01:28:02,535 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 997 transitions, 23514 flow [2025-04-14 01:28:02,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:02,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:28:02,536 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, 1] [2025-04-14 01:28:02,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 01:28:02,536 INFO L403 AbstractCegarLoop]: === Iteration 22 === 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 01:28:02,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:28:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1944987859, now seen corresponding path program 2 times [2025-04-14 01:28:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:28:02,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042784447] [2025-04-14 01:28:02,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:28:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:28:02,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:28:02,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:28:02,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:28:02,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:02,656 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 01:28:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:28:02,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042784447] [2025-04-14 01:28:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042784447] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:28:02,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645754611] [2025-04-14 01:28:02,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:28:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:28:02,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:28:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:28:02,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:28:02,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:28:02,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:28:02,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:02,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 01:28:02,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:28:02,789 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 01:28:02,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:28:03,107 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 01:28:03,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645754611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:28:03,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:28:03,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 10] total 17 [2025-04-14 01:28:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353516543] [2025-04-14 01:28:03,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:28:03,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:28:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:28:03,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:28:03,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:28:03,120 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-04-14 01:28:03,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 997 transitions, 23514 flow. Second operand has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:03,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:28:03,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-04-14 01:28:03,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:28:16,458 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:28:20,470 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:28:24,477 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:28:33,649 INFO L116 PetriNetUnfolderBase]: 52553/77566 cut-off events. [2025-04-14 01:28:33,650 INFO L117 PetriNetUnfolderBase]: For 1536006/1536026 co-relation queries the response was YES. [2025-04-14 01:28:34,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630932 conditions, 77566 events. 52553/77566 cut-off events. For 1536006/1536026 co-relation queries the response was YES. Maximal size of possible extension queue 4390. Compared 595966 event pairs, 441 based on Foata normal form. 763/78327 useless extension candidates. Maximal degree in co-relation 609689. Up to 22243 conditions per place. [2025-04-14 01:28:34,561 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 1769 selfloop transitions, 2554 changer transitions 4/4330 dead transitions. [2025-04-14 01:28:34,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 4330 transitions, 97629 flow [2025-04-14 01:28:34,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-04-14 01:28:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2025-04-14 01:28:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 1507 transitions. [2025-04-14 01:28:34,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5011639507815098 [2025-04-14 01:28:34,564 INFO L175 Difference]: Start difference. First operand has 178 places, 997 transitions, 23514 flow. Second operand 97 states and 1507 transitions. [2025-04-14 01:28:34,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 4330 transitions, 97629 flow [2025-04-14 01:28:44,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 4330 transitions, 97132 flow, removed 139 selfloop flow, removed 3 redundant places. [2025-04-14 01:28:44,732 INFO L231 Difference]: Finished difference. Result has 350 places, 3241 transitions, 78800 flow [2025-04-14 01:28:44,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=23178, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=688, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=78800, PETRI_PLACES=350, PETRI_TRANSITIONS=3241} [2025-04-14 01:28:44,733 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 316 predicate places. [2025-04-14 01:28:44,733 INFO L485 AbstractCegarLoop]: Abstraction has has 350 places, 3241 transitions, 78800 flow [2025-04-14 01:28:44,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.444444444444445) internal successors, (152), 18 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:44,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:28:44,734 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, 1] [2025-04-14 01:28:44,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:28:44,936 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,SelfDestructingSolverStorable21 [2025-04-14 01:28:44,936 INFO L403 AbstractCegarLoop]: === Iteration 23 === 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 01:28:44,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:28:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1787517637, now seen corresponding path program 3 times [2025-04-14 01:28:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:28:44,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572416346] [2025-04-14 01:28:44,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:28:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:28:44,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:28:44,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:28:44,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:28:44,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:28:45,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572416346] [2025-04-14 01:28:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572416346] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:28:45,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335646549] [2025-04-14 01:28:45,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:28:45,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:45,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:28:45,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:28:45,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:28:45,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:28:45,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:28:45,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:28:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:45,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:28:45,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:28:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:45,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:28:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335646549] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:28:45,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:28:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-04-14 01:28:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683815303] [2025-04-14 01:28:45,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:28:45,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:28:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:28:45,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:28:45,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:28:45,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-04-14 01:28:45,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 3241 transitions, 78800 flow. Second operand has 16 states, 16 states have (on average 8.9375) internal successors, (143), 16 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:45,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:28:45,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-04-14 01:28:45,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:29:12,620 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:30:38,709 INFO L116 PetriNetUnfolderBase]: 147333/217284 cut-off events. [2025-04-14 01:30:38,709 INFO L117 PetriNetUnfolderBase]: For 8452331/8452339 co-relation queries the response was YES. [2025-04-14 01:30:44,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273993 conditions, 217284 events. 147333/217284 cut-off events. For 8452331/8452339 co-relation queries the response was YES. Maximal size of possible extension queue 8377. Compared 1795230 event pairs, 1714 based on Foata normal form. 5507/222789 useless extension candidates. Maximal degree in co-relation 2262805. Up to 68760 conditions per place. [2025-04-14 01:30:45,232 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 5786 selfloop transitions, 8370 changer transitions 4/14163 dead transitions. [2025-04-14 01:30:45,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 14163 transitions, 368976 flow [2025-04-14 01:30:45,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-14 01:30:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-04-14 01:30:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 1522 transitions. [2025-04-14 01:30:45,236 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5279223031564343 [2025-04-14 01:30:45,236 INFO L175 Difference]: Start difference. First operand has 350 places, 3241 transitions, 78800 flow. Second operand 93 states and 1522 transitions. [2025-04-14 01:30:45,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 14163 transitions, 368976 flow