/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:56:46,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:56:46,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:56:46,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:56:46,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:56:46,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:56:46,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:56:46,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:56:46,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:56:46,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:56:46,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:56:46,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:56:46,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:56:46,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:56:46,122 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:56:46,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:56:46,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:56:46,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:56:46,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:56:46,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:56:46,124 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:56:46,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:56:46,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:56:46,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:56:46,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:56:46,335 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:56:46,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2025-04-14 00:56:47,619 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b70298b/dd54a1fedcd14df2bfd30df6e141f1e2/FLAGeda524dc4 [2025-04-14 00:56:47,839 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:56:47,840 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2025-04-14 00:56:47,846 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b70298b/dd54a1fedcd14df2bfd30df6e141f1e2/FLAGeda524dc4 [2025-04-14 00:56:48,620 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b70298b/dd54a1fedcd14df2bfd30df6e141f1e2 [2025-04-14 00:56:48,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:56:48,623 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:56:48,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:56:48,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:56:48,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:56:48,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69402433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48, skipping insertion in model container [2025-04-14 00:56:48,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:56:48,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c[2554,2567] [2025-04-14 00:56:48,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:56:48,794 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:56:48,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c[2554,2567] [2025-04-14 00:56:48,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:56:48,823 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:56:48,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48 WrapperNode [2025-04-14 00:56:48,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:56:48,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:56:48,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:56:48,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:56:48,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,851 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-04-14 00:56:48,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:56:48,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:56:48,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:56:48,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:56:48,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,891 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:56:48,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:56:48,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:56:48,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:56:48,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:56:48,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (1/1) ... [2025-04-14 00:56:48,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:56:48,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:48,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:56:48,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:56:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:56:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:56:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:56:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:56:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:56:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:56:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:56:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:56:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:56:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:56:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:56:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:56:48,958 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:56:49,027 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:56:49,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:56:49,248 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:56:49,249 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:56:49,249 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:56:49,414 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:56:49,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:56:49 BoogieIcfgContainer [2025-04-14 00:56:49,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:56:49,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:56:49,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:56:49,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:56:49,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:56:48" (1/3) ... [2025-04-14 00:56:49,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f2bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:56:49, skipping insertion in model container [2025-04-14 00:56:49,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:56:48" (2/3) ... [2025-04-14 00:56:49,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f2bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:56:49, skipping insertion in model container [2025-04-14 00:56:49,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:56:49" (3/3) ... [2025-04-14 00:56:49,422 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-04-14 00:56:49,434 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:56:49,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 53 locations, 51 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:56:49,435 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:56:49,489 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:56:49,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 55 transitions, 138 flow [2025-04-14 00:56:49,564 INFO L116 PetriNetUnfolderBase]: 3/51 cut-off events. [2025-04-14 00:56:49,566 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:56:49,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 51 events. 3/51 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-04-14 00:56:49,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 55 transitions, 138 flow [2025-04-14 00:56:49,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 50 transitions, 124 flow [2025-04-14 00:56:49,582 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:56:49,592 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28ca400e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:56:49,592 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:56:49,617 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:56:49,617 INFO L116 PetriNetUnfolderBase]: 3/49 cut-off events. [2025-04-14 00:56:49,617 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:56:49,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:49,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:49,618 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 2 more)] === [2025-04-14 00:56:49,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 587279921, now seen corresponding path program 1 times [2025-04-14 00:56:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:49,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379509741] [2025-04-14 00:56:49,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:49,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:49,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:56:49,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:56:49,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:49,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:49,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379509741] [2025-04-14 00:56:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379509741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:49,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:49,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:56:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006673834] [2025-04-14 00:56:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:49,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:56:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:49,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:56:49,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:56:49,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:56:49,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:49,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:49,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:56:49,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:51,667 INFO L116 PetriNetUnfolderBase]: 22670/29912 cut-off events. [2025-04-14 00:56:51,667 INFO L117 PetriNetUnfolderBase]: For 1694/1694 co-relation queries the response was YES. [2025-04-14 00:56:51,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61296 conditions, 29912 events. 22670/29912 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 160065 event pairs, 10672 based on Foata normal form. 1/26683 useless extension candidates. Maximal degree in co-relation 57105. Up to 15299 conditions per place. [2025-04-14 00:56:51,801 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 72 selfloop transitions, 6 changer transitions 1/83 dead transitions. [2025-04-14 00:56:51,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 366 flow [2025-04-14 00:56:51,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:56:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:56:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-14 00:56:51,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-04-14 00:56:51,813 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 124 flow. Second operand 3 states and 104 transitions. [2025-04-14 00:56:51,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 366 flow [2025-04-14 00:56:51,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 338 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 00:56:51,868 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 140 flow [2025-04-14 00:56:51,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2025-04-14 00:56:51,875 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-04-14 00:56:51,875 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 140 flow [2025-04-14 00:56:51,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:51,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:51,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:51,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:56:51,876 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 2 more)] === [2025-04-14 00:56:51,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash -904402865, now seen corresponding path program 1 times [2025-04-14 00:56:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:51,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76513441] [2025-04-14 00:56:51,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:51,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:56:51,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:56:51,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:51,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:52,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76513441] [2025-04-14 00:56:52,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76513441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:52,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:52,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:56:52,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253785954] [2025-04-14 00:56:52,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:52,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:56:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:52,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:56:52,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:56:52,033 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:56:52,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:52,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:52,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:56:52,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:54,736 INFO L116 PetriNetUnfolderBase]: 49007/65590 cut-off events. [2025-04-14 00:56:54,736 INFO L117 PetriNetUnfolderBase]: For 5211/5211 co-relation queries the response was YES. [2025-04-14 00:56:54,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142400 conditions, 65590 events. 49007/65590 cut-off events. For 5211/5211 co-relation queries the response was YES. Maximal size of possible extension queue 2256. Compared 393258 event pairs, 14043 based on Foata normal form. 930/59778 useless extension candidates. Maximal degree in co-relation 63040. Up to 25786 conditions per place. [2025-04-14 00:56:55,003 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 130 selfloop transitions, 19 changer transitions 0/153 dead transitions. [2025-04-14 00:56:55,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 153 transitions, 695 flow [2025-04-14 00:56:55,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:56:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:56:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-04-14 00:56:55,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2025-04-14 00:56:55,007 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 140 flow. Second operand 5 states and 180 transitions. [2025-04-14 00:56:55,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 153 transitions, 695 flow [2025-04-14 00:56:55,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 153 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:56:55,014 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 246 flow [2025-04-14 00:56:55,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2025-04-14 00:56:55,015 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-04-14 00:56:55,015 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 246 flow [2025-04-14 00:56:55,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:55,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:55,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:55,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:56:55,016 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 2 more)] === [2025-04-14 00:56:55,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1240289583, now seen corresponding path program 2 times [2025-04-14 00:56:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:55,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752203847] [2025-04-14 00:56:55,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:55,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:56:55,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:56:55,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:55,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:55,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:55,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752203847] [2025-04-14 00:56:55,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752203847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:56:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507326886] [2025-04-14 00:56:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:55,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:56:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:55,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:56:55,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:56:55,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:56:55,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:55,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:55,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:56:55,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:56,840 INFO L116 PetriNetUnfolderBase]: 29523/40871 cut-off events. [2025-04-14 00:56:56,840 INFO L117 PetriNetUnfolderBase]: For 20524/20616 co-relation queries the response was YES. [2025-04-14 00:56:56,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105508 conditions, 40871 events. 29523/40871 cut-off events. For 20524/20616 co-relation queries the response was YES. Maximal size of possible extension queue 1627. Compared 253820 event pairs, 16728 based on Foata normal form. 2/40043 useless extension candidates. Maximal degree in co-relation 61682. Up to 34010 conditions per place. [2025-04-14 00:56:56,949 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 97 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-04-14 00:56:56,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 591 flow [2025-04-14 00:56:56,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:56:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:56:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-04-14 00:56:56,950 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-04-14 00:56:56,950 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 246 flow. Second operand 3 states and 95 transitions. [2025-04-14 00:56:56,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 591 flow [2025-04-14 00:56:56,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 591 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:56:56,958 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 267 flow [2025-04-14 00:56:56,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2025-04-14 00:56:56,960 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-04-14 00:56:56,960 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 267 flow [2025-04-14 00:56:56,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:56,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:56,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:56,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:56:56,960 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 2 more)] === [2025-04-14 00:56:56,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1909250911, now seen corresponding path program 1 times [2025-04-14 00:56:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:56,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045010303] [2025-04-14 00:56:56,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:56,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:56:56,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:56:56,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:56,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:57,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045010303] [2025-04-14 00:56:57,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045010303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:57,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:57,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:56:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360935987] [2025-04-14 00:56:57,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:57,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:56:57,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:57,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:56:57,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:56:57,070 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:56:57,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:57,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:57,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:56:57,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:58,742 INFO L116 PetriNetUnfolderBase]: 29196/40727 cut-off events. [2025-04-14 00:56:58,742 INFO L117 PetriNetUnfolderBase]: For 23136/23136 co-relation queries the response was YES. [2025-04-14 00:56:58,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108927 conditions, 40727 events. 29196/40727 cut-off events. For 23136/23136 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 257063 event pairs, 7427 based on Foata normal form. 655/41298 useless extension candidates. Maximal degree in co-relation 65235. Up to 14367 conditions per place. [2025-04-14 00:56:58,885 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 123 selfloop transitions, 24 changer transitions 3/154 dead transitions. [2025-04-14 00:56:58,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 154 transitions, 859 flow [2025-04-14 00:56:58,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:56:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:56:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-04-14 00:56:58,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-04-14 00:56:58,887 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 267 flow. Second operand 5 states and 176 transitions. [2025-04-14 00:56:58,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 154 transitions, 859 flow [2025-04-14 00:56:58,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 154 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:56:58,911 INFO L231 Difference]: Finished difference. Result has 67 places, 75 transitions, 360 flow [2025-04-14 00:56:58,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=360, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2025-04-14 00:56:58,911 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-04-14 00:56:58,911 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 360 flow [2025-04-14 00:56:58,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:58,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:58,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:58,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:56:58,912 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 2 more)] === [2025-04-14 00:56:58,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2143343637, now seen corresponding path program 2 times [2025-04-14 00:56:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:58,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920423371] [2025-04-14 00:56:58,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:58,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:56:58,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:56:58,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:58,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:59,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:59,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920423371] [2025-04-14 00:56:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920423371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:59,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:56:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861453560] [2025-04-14 00:56:59,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:59,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:56:59,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:59,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:56:59,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:56:59,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:56:59,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:59,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:59,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:56:59,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:01,171 INFO L116 PetriNetUnfolderBase]: 30755/43502 cut-off events. [2025-04-14 00:57:01,172 INFO L117 PetriNetUnfolderBase]: For 36174/36174 co-relation queries the response was YES. [2025-04-14 00:57:01,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123518 conditions, 43502 events. 30755/43502 cut-off events. For 36174/36174 co-relation queries the response was YES. Maximal size of possible extension queue 1802. Compared 282368 event pairs, 5844 based on Foata normal form. 328/43797 useless extension candidates. Maximal degree in co-relation 82348. Up to 18347 conditions per place. [2025-04-14 00:57:01,304 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 139 selfloop transitions, 61 changer transitions 7/211 dead transitions. [2025-04-14 00:57:01,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 211 transitions, 1316 flow [2025-04-14 00:57:01,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:57:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:57:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-04-14 00:57:01,305 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6242424242424243 [2025-04-14 00:57:01,305 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 360 flow. Second operand 6 states and 206 transitions. [2025-04-14 00:57:01,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 211 transitions, 1316 flow [2025-04-14 00:57:01,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 211 transitions, 1270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:01,327 INFO L231 Difference]: Finished difference. Result has 73 places, 112 transitions, 769 flow [2025-04-14 00:57:01,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=769, PETRI_PLACES=73, PETRI_TRANSITIONS=112} [2025-04-14 00:57:01,329 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2025-04-14 00:57:01,329 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 112 transitions, 769 flow [2025-04-14 00:57:01,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:01,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:01,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:01,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:57:01,329 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 2 more)] === [2025-04-14 00:57:01,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1779332452, now seen corresponding path program 1 times [2025-04-14 00:57:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:01,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408649778] [2025-04-14 00:57:01,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:57:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:01,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:01,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:01,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:57:01,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:01,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:01,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408649778] [2025-04-14 00:57:01,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408649778] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:01,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:01,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:57:01,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384322035] [2025-04-14 00:57:01,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:01,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:57:01,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:01,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:57:01,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:57:01,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:01,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 112 transitions, 769 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:01,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:01,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:01,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:03,560 INFO L116 PetriNetUnfolderBase]: 26980/38299 cut-off events. [2025-04-14 00:57:03,560 INFO L117 PetriNetUnfolderBase]: For 65412/65412 co-relation queries the response was YES. [2025-04-14 00:57:03,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121946 conditions, 38299 events. 26980/38299 cut-off events. For 65412/65412 co-relation queries the response was YES. Maximal size of possible extension queue 1500. Compared 245762 event pairs, 7064 based on Foata normal form. 420/38693 useless extension candidates. Maximal degree in co-relation 86109. Up to 18123 conditions per place. [2025-04-14 00:57:03,895 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 138 selfloop transitions, 47 changer transitions 12/201 dead transitions. [2025-04-14 00:57:03,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 201 transitions, 1572 flow [2025-04-14 00:57:03,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:57:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:57:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2025-04-14 00:57:03,896 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-04-14 00:57:03,896 INFO L175 Difference]: Start difference. First operand has 73 places, 112 transitions, 769 flow. Second operand 5 states and 175 transitions. [2025-04-14 00:57:03,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 201 transitions, 1572 flow [2025-04-14 00:57:03,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 201 transitions, 1558 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-04-14 00:57:03,935 INFO L231 Difference]: Finished difference. Result has 79 places, 121 transitions, 988 flow [2025-04-14 00:57:03,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=988, PETRI_PLACES=79, PETRI_TRANSITIONS=121} [2025-04-14 00:57:03,936 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2025-04-14 00:57:03,936 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 121 transitions, 988 flow [2025-04-14 00:57:03,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:03,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:03,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:03,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:57:03,936 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 2 more)] === [2025-04-14 00:57:03,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash -437188621, now seen corresponding path program 3 times [2025-04-14 00:57:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:03,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114791455] [2025-04-14 00:57:03,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:57:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:03,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:03,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:03,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:57:03,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:04,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114791455] [2025-04-14 00:57:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114791455] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:57:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113798008] [2025-04-14 00:57:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:04,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:57:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:04,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:57:04,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:57:04,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:04,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 121 transitions, 988 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:04,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:04,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:04,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:05,727 INFO L116 PetriNetUnfolderBase]: 23672/33687 cut-off events. [2025-04-14 00:57:05,727 INFO L117 PetriNetUnfolderBase]: For 73755/73755 co-relation queries the response was YES. [2025-04-14 00:57:05,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114236 conditions, 33687 events. 23672/33687 cut-off events. For 73755/73755 co-relation queries the response was YES. Maximal size of possible extension queue 1415. Compared 213058 event pairs, 5044 based on Foata normal form. 470/34133 useless extension candidates. Maximal degree in co-relation 78733. Up to 13881 conditions per place. [2025-04-14 00:57:05,872 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 140 selfloop transitions, 72 changer transitions 10/226 dead transitions. [2025-04-14 00:57:05,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 226 transitions, 1885 flow [2025-04-14 00:57:05,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:57:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:57:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2025-04-14 00:57:05,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-04-14 00:57:05,873 INFO L175 Difference]: Start difference. First operand has 79 places, 121 transitions, 988 flow. Second operand 6 states and 208 transitions. [2025-04-14 00:57:05,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 226 transitions, 1885 flow [2025-04-14 00:57:05,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 226 transitions, 1822 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:05,930 INFO L231 Difference]: Finished difference. Result has 83 places, 124 transitions, 1145 flow [2025-04-14 00:57:05,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1145, PETRI_PLACES=83, PETRI_TRANSITIONS=124} [2025-04-14 00:57:05,930 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2025-04-14 00:57:05,931 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 124 transitions, 1145 flow [2025-04-14 00:57:05,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:05,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:05,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:05,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:57:05,931 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 2 more)] === [2025-04-14 00:57:05,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 121053939, now seen corresponding path program 4 times [2025-04-14 00:57:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:05,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879327756] [2025-04-14 00:57:05,932 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:57:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:05,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-14 00:57:05,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:05,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:57:05,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:06,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879327756] [2025-04-14 00:57:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879327756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:57:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761456374] [2025-04-14 00:57:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:06,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:06,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:06,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:06,108 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:06,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 124 transitions, 1145 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:06,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:06,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:06,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:08,170 INFO L116 PetriNetUnfolderBase]: 24190/34559 cut-off events. [2025-04-14 00:57:08,170 INFO L117 PetriNetUnfolderBase]: For 99637/99637 co-relation queries the response was YES. [2025-04-14 00:57:08,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123397 conditions, 34559 events. 24190/34559 cut-off events. For 99637/99637 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 220384 event pairs, 5587 based on Foata normal form. 476/35011 useless extension candidates. Maximal degree in co-relation 85431. Up to 13810 conditions per place. [2025-04-14 00:57:08,315 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 170 selfloop transitions, 91 changer transitions 3/268 dead transitions. [2025-04-14 00:57:08,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 268 transitions, 2413 flow [2025-04-14 00:57:08,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2025-04-14 00:57:08,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2025-04-14 00:57:08,316 INFO L175 Difference]: Start difference. First operand has 83 places, 124 transitions, 1145 flow. Second operand 8 states and 265 transitions. [2025-04-14 00:57:08,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 268 transitions, 2413 flow [2025-04-14 00:57:08,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 268 transitions, 2218 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-14 00:57:08,399 INFO L231 Difference]: Finished difference. Result has 87 places, 143 transitions, 1462 flow [2025-04-14 00:57:08,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1462, PETRI_PLACES=87, PETRI_TRANSITIONS=143} [2025-04-14 00:57:08,400 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 27 predicate places. [2025-04-14 00:57:08,400 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 143 transitions, 1462 flow [2025-04-14 00:57:08,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:08,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:08,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:08,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:57:08,400 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 2 more)] === [2025-04-14 00:57:08,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1164718696, now seen corresponding path program 2 times [2025-04-14 00:57:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:08,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802570612] [2025-04-14 00:57:08,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:57:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:08,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:08,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:08,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:57:08,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:08,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:08,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802570612] [2025-04-14 00:57:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802570612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:57:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134431184] [2025-04-14 00:57:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:08,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:08,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:08,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:08,546 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:08,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 143 transitions, 1462 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:08,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:08,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:08,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:10,527 INFO L116 PetriNetUnfolderBase]: 21855/31583 cut-off events. [2025-04-14 00:57:10,528 INFO L117 PetriNetUnfolderBase]: For 89951/89951 co-relation queries the response was YES. [2025-04-14 00:57:10,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113729 conditions, 31583 events. 21855/31583 cut-off events. For 89951/89951 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 203211 event pairs, 5204 based on Foata normal form. 836/32396 useless extension candidates. Maximal degree in co-relation 81796. Up to 12695 conditions per place. [2025-04-14 00:57:10,632 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 164 selfloop transitions, 98 changer transitions 26/292 dead transitions. [2025-04-14 00:57:10,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 292 transitions, 2832 flow [2025-04-14 00:57:10,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 268 transitions. [2025-04-14 00:57:10,634 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6090909090909091 [2025-04-14 00:57:10,634 INFO L175 Difference]: Start difference. First operand has 87 places, 143 transitions, 1462 flow. Second operand 8 states and 268 transitions. [2025-04-14 00:57:10,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 292 transitions, 2832 flow [2025-04-14 00:57:10,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 292 transitions, 2689 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:57:10,708 INFO L231 Difference]: Finished difference. Result has 93 places, 150 transitions, 1660 flow [2025-04-14 00:57:10,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1660, PETRI_PLACES=93, PETRI_TRANSITIONS=150} [2025-04-14 00:57:10,709 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 33 predicate places. [2025-04-14 00:57:10,709 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 150 transitions, 1660 flow [2025-04-14 00:57:10,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:10,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:10,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:10,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:57:10,709 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 2 more)] === [2025-04-14 00:57:10,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 937739189, now seen corresponding path program 5 times [2025-04-14 00:57:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:10,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912980902] [2025-04-14 00:57:10,710 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:10,715 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:10,719 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:10,719 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:57:10,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:10,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:10,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912980902] [2025-04-14 00:57:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912980902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:57:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420510130] [2025-04-14 00:57:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:10,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:10,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:10,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 150 transitions, 1660 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:10,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:10,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:10,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:12,219 INFO L116 PetriNetUnfolderBase]: 16473/24284 cut-off events. [2025-04-14 00:57:12,220 INFO L117 PetriNetUnfolderBase]: For 76393/76393 co-relation queries the response was YES. [2025-04-14 00:57:12,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89464 conditions, 24284 events. 16473/24284 cut-off events. For 76393/76393 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 155540 event pairs, 4192 based on Foata normal form. 240/24507 useless extension candidates. Maximal degree in co-relation 68896. Up to 9522 conditions per place. [2025-04-14 00:57:12,302 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 137 selfloop transitions, 108 changer transitions 27/276 dead transitions. [2025-04-14 00:57:12,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 276 transitions, 3008 flow [2025-04-14 00:57:12,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 244 transitions. [2025-04-14 00:57:12,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5545454545454546 [2025-04-14 00:57:12,304 INFO L175 Difference]: Start difference. First operand has 93 places, 150 transitions, 1660 flow. Second operand 8 states and 244 transitions. [2025-04-14 00:57:12,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 276 transitions, 3008 flow [2025-04-14 00:57:12,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 276 transitions, 2963 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:12,383 INFO L231 Difference]: Finished difference. Result has 100 places, 158 transitions, 2010 flow [2025-04-14 00:57:12,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2010, PETRI_PLACES=100, PETRI_TRANSITIONS=158} [2025-04-14 00:57:12,383 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 40 predicate places. [2025-04-14 00:57:12,384 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 158 transitions, 2010 flow [2025-04-14 00:57:12,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:12,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:12,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:12,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:57:12,384 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 2 more)] === [2025-04-14 00:57:12,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2023375419, now seen corresponding path program 6 times [2025-04-14 00:57:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:12,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37747562] [2025-04-14 00:57:12,384 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:57:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:12,389 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:12,394 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:12,394 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:57:12,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:12,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37747562] [2025-04-14 00:57:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37747562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:12,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:12,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:57:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107957823] [2025-04-14 00:57:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:12,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:12,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:12,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 158 transitions, 2010 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:12,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:12,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:12,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:14,542 INFO L116 PetriNetUnfolderBase]: 15919/23558 cut-off events. [2025-04-14 00:57:14,542 INFO L117 PetriNetUnfolderBase]: For 87397/87397 co-relation queries the response was YES. [2025-04-14 00:57:14,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88225 conditions, 23558 events. 15919/23558 cut-off events. For 87397/87397 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 151129 event pairs, 4001 based on Foata normal form. 48/23592 useless extension candidates. Maximal degree in co-relation 66375. Up to 9496 conditions per place. [2025-04-14 00:57:14,636 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 120 selfloop transitions, 140 changer transitions 16/280 dead transitions. [2025-04-14 00:57:14,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 280 transitions, 3332 flow [2025-04-14 00:57:14,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 228 transitions. [2025-04-14 00:57:14,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2025-04-14 00:57:14,638 INFO L175 Difference]: Start difference. First operand has 100 places, 158 transitions, 2010 flow. Second operand 8 states and 228 transitions. [2025-04-14 00:57:14,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 280 transitions, 3332 flow [2025-04-14 00:57:14,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 280 transitions, 3273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:14,747 INFO L231 Difference]: Finished difference. Result has 106 places, 184 transitions, 2590 flow [2025-04-14 00:57:14,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2590, PETRI_PLACES=106, PETRI_TRANSITIONS=184} [2025-04-14 00:57:14,748 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 46 predicate places. [2025-04-14 00:57:14,748 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 184 transitions, 2590 flow [2025-04-14 00:57:14,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:14,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:14,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:14,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:57:14,748 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 2 more)] === [2025-04-14 00:57:14,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2136033145, now seen corresponding path program 7 times [2025-04-14 00:57:14,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:14,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355561234] [2025-04-14 00:57:14,750 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:57:14,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:14,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:14,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:57:14,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:14,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:14,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355561234] [2025-04-14 00:57:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355561234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:14,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:14,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:57:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446347121] [2025-04-14 00:57:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:14,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:14,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:14,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:14,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:14,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 184 transitions, 2590 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:14,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:16,475 INFO L116 PetriNetUnfolderBase]: 14704/21803 cut-off events. [2025-04-14 00:57:16,475 INFO L117 PetriNetUnfolderBase]: For 102206/102206 co-relation queries the response was YES. [2025-04-14 00:57:16,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84151 conditions, 21803 events. 14704/21803 cut-off events. For 102206/102206 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 139276 event pairs, 3761 based on Foata normal form. 104/21896 useless extension candidates. Maximal degree in co-relation 62542. Up to 8736 conditions per place. [2025-04-14 00:57:16,547 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 128 selfloop transitions, 144 changer transitions 8/284 dead transitions. [2025-04-14 00:57:16,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 284 transitions, 3604 flow [2025-04-14 00:57:16,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2025-04-14 00:57:16,548 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2025-04-14 00:57:16,548 INFO L175 Difference]: Start difference. First operand has 106 places, 184 transitions, 2590 flow. Second operand 8 states and 236 transitions. [2025-04-14 00:57:16,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 284 transitions, 3604 flow [2025-04-14 00:57:16,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 284 transitions, 3389 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-04-14 00:57:16,656 INFO L231 Difference]: Finished difference. Result has 109 places, 188 transitions, 2745 flow [2025-04-14 00:57:16,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2399, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2745, PETRI_PLACES=109, PETRI_TRANSITIONS=188} [2025-04-14 00:57:16,656 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 49 predicate places. [2025-04-14 00:57:16,657 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 188 transitions, 2745 flow [2025-04-14 00:57:16,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:16,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:16,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:16,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:57:16,657 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 2 more)] === [2025-04-14 00:57:16,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:16,657 INFO L85 PathProgramCache]: Analyzing trace with hash 462941729, now seen corresponding path program 8 times [2025-04-14 00:57:16,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:16,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818393882] [2025-04-14 00:57:16,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:57:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:16,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:16,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:16,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:57:16,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:16,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:16,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818393882] [2025-04-14 00:57:16,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818393882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:16,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:57:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297426549] [2025-04-14 00:57:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:16,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:57:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:16,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:57:16,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:57:16,746 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:16,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 188 transitions, 2745 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:16,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:16,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:16,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:18,669 INFO L116 PetriNetUnfolderBase]: 15070/22425 cut-off events. [2025-04-14 00:57:18,670 INFO L117 PetriNetUnfolderBase]: For 124026/124026 co-relation queries the response was YES. [2025-04-14 00:57:18,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89580 conditions, 22425 events. 15070/22425 cut-off events. For 124026/124026 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 144758 event pairs, 3872 based on Foata normal form. 208/22622 useless extension candidates. Maximal degree in co-relation 66007. Up to 8752 conditions per place. [2025-04-14 00:57:18,777 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 158 selfloop transitions, 146 changer transitions 23/331 dead transitions. [2025-04-14 00:57:18,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 331 transitions, 4133 flow [2025-04-14 00:57:18,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:57:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:57:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 317 transitions. [2025-04-14 00:57:18,778 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4803030303030303 [2025-04-14 00:57:18,778 INFO L175 Difference]: Start difference. First operand has 109 places, 188 transitions, 2745 flow. Second operand 12 states and 317 transitions. [2025-04-14 00:57:18,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 331 transitions, 4133 flow [2025-04-14 00:57:18,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 331 transitions, 3956 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 00:57:18,905 INFO L231 Difference]: Finished difference. Result has 118 places, 190 transitions, 2901 flow [2025-04-14 00:57:18,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2578, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2901, PETRI_PLACES=118, PETRI_TRANSITIONS=190} [2025-04-14 00:57:18,906 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 58 predicate places. [2025-04-14 00:57:18,906 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 190 transitions, 2901 flow [2025-04-14 00:57:18,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:18,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:18,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:18,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:57:18,907 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 2 more)] === [2025-04-14 00:57:18,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1457198539, now seen corresponding path program 9 times [2025-04-14 00:57:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:18,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933542864] [2025-04-14 00:57:18,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:57:18,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:18,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:18,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:18,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:57:18,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:18,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933542864] [2025-04-14 00:57:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933542864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:57:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253326747] [2025-04-14 00:57:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:18,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:57:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:18,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:57:18,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:57:18,987 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:18,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 190 transitions, 2901 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:18,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:18,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:20,502 INFO L116 PetriNetUnfolderBase]: 15170/22604 cut-off events. [2025-04-14 00:57:20,502 INFO L117 PetriNetUnfolderBase]: For 144768/144768 co-relation queries the response was YES. [2025-04-14 00:57:20,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92875 conditions, 22604 events. 15170/22604 cut-off events. For 144768/144768 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 146462 event pairs, 4208 based on Foata normal form. 96/22690 useless extension candidates. Maximal degree in co-relation 68670. Up to 8968 conditions per place. [2025-04-14 00:57:20,603 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 125 selfloop transitions, 122 changer transitions 70/321 dead transitions. [2025-04-14 00:57:20,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 321 transitions, 4335 flow [2025-04-14 00:57:20,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:57:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:57:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 301 transitions. [2025-04-14 00:57:20,604 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45606060606060606 [2025-04-14 00:57:20,604 INFO L175 Difference]: Start difference. First operand has 118 places, 190 transitions, 2901 flow. Second operand 12 states and 301 transitions. [2025-04-14 00:57:20,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 321 transitions, 4335 flow [2025-04-14 00:57:20,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 321 transitions, 4168 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-04-14 00:57:20,792 INFO L231 Difference]: Finished difference. Result has 127 places, 166 transitions, 2522 flow [2025-04-14 00:57:20,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2768, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2522, PETRI_PLACES=127, PETRI_TRANSITIONS=166} [2025-04-14 00:57:20,792 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 67 predicate places. [2025-04-14 00:57:20,792 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 166 transitions, 2522 flow [2025-04-14 00:57:20,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:20,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:20,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:20,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:57:20,793 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 2 more)] === [2025-04-14 00:57:20,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash -804794202, now seen corresponding path program 3 times [2025-04-14 00:57:20,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:20,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075541055] [2025-04-14 00:57:20,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:57:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:20,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:20,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:20,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:57:20,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:20,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:20,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075541055] [2025-04-14 00:57:20,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075541055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:20,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:20,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:57:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889565224] [2025-04-14 00:57:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:20,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:57:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:20,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:57:20,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:57:20,873 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:20,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 166 transitions, 2522 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:20,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:20,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:20,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:22,345 INFO L116 PetriNetUnfolderBase]: 14640/21850 cut-off events. [2025-04-14 00:57:22,345 INFO L117 PetriNetUnfolderBase]: For 151566/151566 co-relation queries the response was YES. [2025-04-14 00:57:22,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90374 conditions, 21850 events. 14640/21850 cut-off events. For 151566/151566 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 141480 event pairs, 4095 based on Foata normal form. 312/22152 useless extension candidates. Maximal degree in co-relation 66181. Up to 8736 conditions per place. [2025-04-14 00:57:22,449 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 148 selfloop transitions, 122 changer transitions 39/313 dead transitions. [2025-04-14 00:57:22,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 313 transitions, 3982 flow [2025-04-14 00:57:22,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:57:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:57:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 318 transitions. [2025-04-14 00:57:22,450 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2025-04-14 00:57:22,450 INFO L175 Difference]: Start difference. First operand has 127 places, 166 transitions, 2522 flow. Second operand 12 states and 318 transitions. [2025-04-14 00:57:22,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 313 transitions, 3982 flow [2025-04-14 00:57:22,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 313 transitions, 3664 flow, removed 18 selfloop flow, removed 9 redundant places. [2025-04-14 00:57:22,623 INFO L231 Difference]: Finished difference. Result has 128 places, 165 transitions, 2473 flow [2025-04-14 00:57:22,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2473, PETRI_PLACES=128, PETRI_TRANSITIONS=165} [2025-04-14 00:57:22,624 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 68 predicate places. [2025-04-14 00:57:22,624 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 165 transitions, 2473 flow [2025-04-14 00:57:22,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:22,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:22,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:22,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:57:22,624 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 2 more)] === [2025-04-14 00:57:22,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash -771041575, now seen corresponding path program 10 times [2025-04-14 00:57:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:22,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049897977] [2025-04-14 00:57:22,625 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:57:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:22,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-14 00:57:22,633 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:22,633 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:57:22,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:22,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049897977] [2025-04-14 00:57:22,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049897977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:22,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:22,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:57:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327128251] [2025-04-14 00:57:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:22,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:57:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:22,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:57:22,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:57:22,714 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:22,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 165 transitions, 2473 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:22,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:22,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:22,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:23,788 INFO L116 PetriNetUnfolderBase]: 11528/17336 cut-off events. [2025-04-14 00:57:23,789 INFO L117 PetriNetUnfolderBase]: For 112894/112894 co-relation queries the response was YES. [2025-04-14 00:57:23,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71068 conditions, 17336 events. 11528/17336 cut-off events. For 112894/112894 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 110444 event pairs, 3404 based on Foata normal form. 112/17437 useless extension candidates. Maximal degree in co-relation 52685. Up to 7234 conditions per place. [2025-04-14 00:57:23,857 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 96 selfloop transitions, 108 changer transitions 26/234 dead transitions. [2025-04-14 00:57:23,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 234 transitions, 3216 flow [2025-04-14 00:57:23,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:57:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:57:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2025-04-14 00:57:23,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4505050505050505 [2025-04-14 00:57:23,859 INFO L175 Difference]: Start difference. First operand has 128 places, 165 transitions, 2473 flow. Second operand 9 states and 223 transitions. [2025-04-14 00:57:23,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 234 transitions, 3216 flow [2025-04-14 00:57:24,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 234 transitions, 3164 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 00:57:24,010 INFO L231 Difference]: Finished difference. Result has 133 places, 144 transitions, 2273 flow [2025-04-14 00:57:24,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2273, PETRI_PLACES=133, PETRI_TRANSITIONS=144} [2025-04-14 00:57:24,010 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 73 predicate places. [2025-04-14 00:57:24,010 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 144 transitions, 2273 flow [2025-04-14 00:57:24,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:24,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:24,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:24,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:57:24,011 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 2 more)] === [2025-04-14 00:57:24,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -463538313, now seen corresponding path program 3 times [2025-04-14 00:57:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:24,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775084542] [2025-04-14 00:57:24,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:57:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:24,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:24,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:24,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:57:24,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:24,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:24,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775084542] [2025-04-14 00:57:24,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775084542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:24,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:24,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:57:24,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147873668] [2025-04-14 00:57:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:24,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:24,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:24,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:24,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:24,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 144 transitions, 2273 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:24,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:24,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:24,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:24,477 INFO L116 PetriNetUnfolderBase]: 2542/4150 cut-off events. [2025-04-14 00:57:24,477 INFO L117 PetriNetUnfolderBase]: For 28078/28078 co-relation queries the response was YES. [2025-04-14 00:57:24,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18898 conditions, 4150 events. 2542/4150 cut-off events. For 28078/28078 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22984 event pairs, 612 based on Foata normal form. 72/4218 useless extension candidates. Maximal degree in co-relation 15278. Up to 1194 conditions per place. [2025-04-14 00:57:24,491 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 68 selfloop transitions, 26 changer transitions 72/170 dead transitions. [2025-04-14 00:57:24,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 170 transitions, 2239 flow [2025-04-14 00:57:24,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2025-04-14 00:57:24,492 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2025-04-14 00:57:24,492 INFO L175 Difference]: Start difference. First operand has 133 places, 144 transitions, 2273 flow. Second operand 8 states and 195 transitions. [2025-04-14 00:57:24,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 170 transitions, 2239 flow [2025-04-14 00:57:24,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 170 transitions, 1976 flow, removed 12 selfloop flow, removed 18 redundant places. [2025-04-14 00:57:24,514 INFO L231 Difference]: Finished difference. Result has 124 places, 64 transitions, 638 flow [2025-04-14 00:57:24,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=638, PETRI_PLACES=124, PETRI_TRANSITIONS=64} [2025-04-14 00:57:24,514 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 64 predicate places. [2025-04-14 00:57:24,514 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 64 transitions, 638 flow [2025-04-14 00:57:24,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:24,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:24,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:24,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:57:24,515 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 2 more)] === [2025-04-14 00:57:24,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1581405915, now seen corresponding path program 4 times [2025-04-14 00:57:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:24,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917598881] [2025-04-14 00:57:24,515 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:57:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:24,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-14 00:57:24,522 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:24,522 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:57:24,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:24,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917598881] [2025-04-14 00:57:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917598881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:57:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081128508] [2025-04-14 00:57:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:24,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:57:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:24,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:57:24,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:57:24,597 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:24,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 64 transitions, 638 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:24,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:24,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:24,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:24,770 INFO L116 PetriNetUnfolderBase]: 685/1130 cut-off events. [2025-04-14 00:57:24,771 INFO L117 PetriNetUnfolderBase]: For 4338/4338 co-relation queries the response was YES. [2025-04-14 00:57:24,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 1130 events. 685/1130 cut-off events. For 4338/4338 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4380 event pairs, 116 based on Foata normal form. 16/1145 useless extension candidates. Maximal degree in co-relation 2385. Up to 324 conditions per place. [2025-04-14 00:57:24,773 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 57 selfloop transitions, 18 changer transitions 19/98 dead transitions. [2025-04-14 00:57:24,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 947 flow [2025-04-14 00:57:24,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-04-14 00:57:24,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2025-04-14 00:57:24,774 INFO L175 Difference]: Start difference. First operand has 124 places, 64 transitions, 638 flow. Second operand 8 states and 155 transitions. [2025-04-14 00:57:24,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 947 flow [2025-04-14 00:57:24,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 667 flow, removed 41 selfloop flow, removed 34 redundant places. [2025-04-14 00:57:24,778 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 294 flow [2025-04-14 00:57:24,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=87, PETRI_TRANSITIONS=52} [2025-04-14 00:57:24,778 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 27 predicate places. [2025-04-14 00:57:24,778 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 294 flow [2025-04-14 00:57:24,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:24,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:24,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:57:24,779 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 2 more)] === [2025-04-14 00:57:24,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:24,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1563530325, now seen corresponding path program 5 times [2025-04-14 00:57:24,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:24,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597577373] [2025-04-14 00:57:24,779 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:24,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:57:24,785 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:57:24,785 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:57:24,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:24,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597577373] [2025-04-14 00:57:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597577373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:24,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:57:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743473692] [2025-04-14 00:57:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:24,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:57:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:24,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:57:24,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:57:24,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-04-14 00:57:24,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 52 transitions, 294 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:24,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:24,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-04-14 00:57:24,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:24,975 INFO L116 PetriNetUnfolderBase]: 120/245 cut-off events. [2025-04-14 00:57:24,975 INFO L117 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-04-14 00:57:24,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 245 events. 120/245 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 621 event pairs, 24 based on Foata normal form. 8/252 useless extension candidates. Maximal degree in co-relation 510. Up to 80 conditions per place. [2025-04-14 00:57:24,976 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2025-04-14 00:57:24,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 62 transitions, 422 flow [2025-04-14 00:57:24,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:57:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:57:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-14 00:57:24,977 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26262626262626265 [2025-04-14 00:57:24,977 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 294 flow. Second operand 9 states and 130 transitions. [2025-04-14 00:57:24,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 62 transitions, 422 flow [2025-04-14 00:57:24,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 327 flow, removed 2 selfloop flow, removed 21 redundant places. [2025-04-14 00:57:24,978 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2025-04-14 00:57:24,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2025-04-14 00:57:24,978 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-04-14 00:57:24,978 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2025-04-14 00:57:24,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:24,980 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 00:57:24,980 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-14 00:57:24,980 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 00:57:24,980 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-14 00:57:24,980 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-14 00:57:24,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:57:24,981 INFO L422 BasicCegarLoop]: Path program histogram: [10, 5, 3, 1] [2025-04-14 00:57:24,982 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:57:24,983 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:57:24,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:57:24 BasicIcfg [2025-04-14 00:57:24,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:57:24,986 INFO L158 Benchmark]: Toolchain (without parser) took 36362.60ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 100.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2025-04-14 00:57:24,986 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:57:24,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.02ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 85.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:57:24,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.58ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:57:24,986 INFO L158 Benchmark]: Boogie Preprocessor took 54.33ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:57:24,987 INFO L158 Benchmark]: IcfgBuilder took 503.91ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 37.3MB in the end (delta: 44.0MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-14 00:57:24,987 INFO L158 Benchmark]: TraceAbstraction took 35569.52ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 36.8MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-14 00:57:24,988 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.02ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 85.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.58ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.33ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 503.91ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 37.3MB in the end (delta: 44.0MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 35569.52ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 36.8MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 86 locations, 91 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 32.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1701 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1701 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 370 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6643 IncrementalHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 370 mSolverCounterUnsat, 0 mSDtfsCounter, 6643 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2901occurred in iteration=13, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 835 ConstructedInterpolants, 0 QuantifiedInterpolants, 2095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:57:24,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...