/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/bench-exp2x9.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:24:46,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:24:46,089 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:24:46,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:24:46,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:24:46,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:24:46,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:24:46,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:24:46,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:24:46,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:24:46,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:24:46,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:24:46,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:24:46,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:24:46,120 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:24:46,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:24:46,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:24:46,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:24:46,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:24:46,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:24:46,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:24:46,122 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:24:46,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:24:46,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:24:46,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:24:46,345 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:24:46,346 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:24:46,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2025-04-14 00:24:47,593 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7728b3519/0e853e6ddda8406583954962d02486ab/FLAG826ba913a [2025-04-14 00:24:47,830 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:24:47,830 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2025-04-14 00:24:47,840 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7728b3519/0e853e6ddda8406583954962d02486ab/FLAG826ba913a [2025-04-14 00:24:48,644 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7728b3519/0e853e6ddda8406583954962d02486ab [2025-04-14 00:24:48,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:24:48,646 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:24:48,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:24:48,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:24:48,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:24:48,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332590df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48, skipping insertion in model container [2025-04-14 00:24:48,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:24:48,832 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/bench-exp2x9.wvr.c[2721,2734] [2025-04-14 00:24:48,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:24:48,847 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:24:48,880 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/bench-exp2x9.wvr.c[2721,2734] [2025-04-14 00:24:48,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:24:48,894 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:24:48,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48 WrapperNode [2025-04-14 00:24:48,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:24:48,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:24:48,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:24:48,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:24:48,901 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:24:48" (1/1) ... [2025-04-14 00:24:48,910 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:24:48" (1/1) ... [2025-04-14 00:24:48,924 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-14 00:24:48,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:24:48,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:24:48,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:24:48,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:24:48,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,945 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:24:48,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:24:48,957 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:24:48,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:24:48,958 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:24:48,958 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (1/1) ... [2025-04-14 00:24:48,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:24:48,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:48,982 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:24:48,984 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:24:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:24:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:24:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:24:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:24:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:24:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:24:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:24:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:24:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:24:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:24:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:24:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:24:49,000 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:24:49,055 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:24:49,056 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:24:49,216 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:24:49,216 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:24:49,216 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:24:49,339 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:24:49,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:24:49 BoogieIcfgContainer [2025-04-14 00:24:49,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:24:49,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:24:49,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:24:49,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:24:49,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:24:48" (1/3) ... [2025-04-14 00:24:49,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ede973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:24:49, skipping insertion in model container [2025-04-14 00:24:49,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:24:48" (2/3) ... [2025-04-14 00:24:49,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ede973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:24:49, skipping insertion in model container [2025-04-14 00:24:49,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:24:49" (3/3) ... [2025-04-14 00:24:49,346 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-04-14 00:24:49,354 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:24:49,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 28 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 00:24:49,356 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:24:49,389 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:24:49,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2025-04-14 00:24:49,439 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-14 00:24:49,442 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:24:49,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-14 00:24:49,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2025-04-14 00:24:49,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-14 00:24:49,454 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:24:49,462 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;@43968446, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:24:49,462 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:24:49,475 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:24:49,475 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-14 00:24:49,475 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:24:49,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:49,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:49,476 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:24:49,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1557854990, now seen corresponding path program 1 times [2025-04-14 00:24:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:49,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322203484] [2025-04-14 00:24:49,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:49,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:49,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:24:49,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:24:49,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:49,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:49,806 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:24:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:49,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322203484] [2025-04-14 00:24:49,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322203484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:24:49,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:24:49,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:24:49,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497463314] [2025-04-14 00:24:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:24:49,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:24:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:49,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:24:49,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:24:49,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:49,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:24:49,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:49,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:49,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:50,073 INFO L116 PetriNetUnfolderBase]: 1367/1731 cut-off events. [2025-04-14 00:24:50,073 INFO L117 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-04-14 00:24:50,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1731 events. 1367/1731 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5566 event pairs, 123 based on Foata normal form. 1/997 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-04-14 00:24:50,088 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2025-04-14 00:24:50,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 217 flow [2025-04-14 00:24:50,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:24:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:24:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-14 00:24:50,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-14 00:24:50,101 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 76 flow. Second operand 3 states and 66 transitions. [2025-04-14 00:24:50,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 217 flow [2025-04-14 00:24:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 00:24:50,112 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 93 flow [2025-04-14 00:24:50,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2025-04-14 00:24:50,117 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-14 00:24:50,117 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 93 flow [2025-04-14 00:24:50,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:24:50,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:50,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:50,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:24:50,118 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:24:50,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1873025254, now seen corresponding path program 1 times [2025-04-14 00:24:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:50,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834874113] [2025-04-14 00:24:50,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:50,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:24:50,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:50,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:50,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:50,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834874113] [2025-04-14 00:24:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834874113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:24:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:24:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:24:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604169588] [2025-04-14 00:24:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:24:50,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:24:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:50,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:24:50,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:24:50,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:50,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:50,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:50,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:50,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:50,534 INFO L116 PetriNetUnfolderBase]: 1558/2013 cut-off events. [2025-04-14 00:24:50,535 INFO L117 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2025-04-14 00:24:50,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 2013 events. 1558/2013 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6881 event pairs, 87 based on Foata normal form. 33/2024 useless extension candidates. Maximal degree in co-relation 1788. Up to 826 conditions per place. [2025-04-14 00:24:50,549 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 57 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-04-14 00:24:50,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 351 flow [2025-04-14 00:24:50,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 00:24:50,551 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-14 00:24:50,551 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 93 flow. Second operand 5 states and 101 transitions. [2025-04-14 00:24:50,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 351 flow [2025-04-14 00:24:50,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 71 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:24:50,553 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 153 flow [2025-04-14 00:24:50,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-04-14 00:24:50,553 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-14 00:24:50,553 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 153 flow [2025-04-14 00:24:50,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:50,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:50,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:50,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:24:50,555 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:24:50,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1340302845, now seen corresponding path program 1 times [2025-04-14 00:24:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:50,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489553826] [2025-04-14 00:24:50,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:50,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:24:50,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:50,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:50,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:50,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489553826] [2025-04-14 00:24:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489553826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:50,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710696228] [2025-04-14 00:24:50,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:50,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:50,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:24:50,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:24:50,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:24:50,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:50,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:50,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:50,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:24:50,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:24:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:50,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710696228] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:50,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:50,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:24:50,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576325485] [2025-04-14 00:24:50,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:50,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:24:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:50,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:24:50,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:24:50,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:50,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:24:50,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:50,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:50,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:51,107 INFO L116 PetriNetUnfolderBase]: 1955/2589 cut-off events. [2025-04-14 00:24:51,107 INFO L117 PetriNetUnfolderBase]: For 2855/2855 co-relation queries the response was YES. [2025-04-14 00:24:51,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 2589 events. 1955/2589 cut-off events. For 2855/2855 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10478 event pairs, 325 based on Foata normal form. 80/2661 useless extension candidates. Maximal degree in co-relation 4051. Up to 1294 conditions per place. [2025-04-14 00:24:51,122 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 89 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2025-04-14 00:24:51,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 101 transitions, 613 flow [2025-04-14 00:24:51,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-04-14 00:24:51,124 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7290322580645161 [2025-04-14 00:24:51,124 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 153 flow. Second operand 5 states and 113 transitions. [2025-04-14 00:24:51,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 101 transitions, 613 flow [2025-04-14 00:24:51,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 101 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:24:51,130 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 208 flow [2025-04-14 00:24:51,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-14 00:24:51,131 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-04-14 00:24:51,131 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 208 flow [2025-04-14 00:24:51,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:24:51,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:51,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:51,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:24:51,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:51,336 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:24:51,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1737502214, now seen corresponding path program 1 times [2025-04-14 00:24:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:51,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779931122] [2025-04-14 00:24:51,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:51,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:51,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:24:51,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:51,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:51,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:51,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:51,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779931122] [2025-04-14 00:24:51,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779931122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:24:51,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:24:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:24:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769345374] [2025-04-14 00:24:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:24:51,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:24:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:51,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:24:51,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:24:51,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:51,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:51,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:51,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:51,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:51,679 INFO L116 PetriNetUnfolderBase]: 1925/2549 cut-off events. [2025-04-14 00:24:51,679 INFO L117 PetriNetUnfolderBase]: For 4632/4632 co-relation queries the response was YES. [2025-04-14 00:24:51,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9408 conditions, 2549 events. 1925/2549 cut-off events. For 4632/4632 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10138 event pairs, 162 based on Foata normal form. 46/2593 useless extension candidates. Maximal degree in co-relation 4950. Up to 1049 conditions per place. [2025-04-14 00:24:51,691 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 89 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-04-14 00:24:51,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 103 transitions, 685 flow [2025-04-14 00:24:51,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-14 00:24:51,694 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-14 00:24:51,694 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 208 flow. Second operand 5 states and 109 transitions. [2025-04-14 00:24:51,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 103 transitions, 685 flow [2025-04-14 00:24:51,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 103 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:24:51,704 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 271 flow [2025-04-14 00:24:51,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-14 00:24:51,704 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-04-14 00:24:51,704 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 271 flow [2025-04-14 00:24:51,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:51,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:51,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:51,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:24:51,705 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:24:51,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1771111075, now seen corresponding path program 1 times [2025-04-14 00:24:51,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:51,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461544323] [2025-04-14 00:24:51,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:51,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:24:51,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:51,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:51,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:51,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:51,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461544323] [2025-04-14 00:24:51,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461544323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:51,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650442238] [2025-04-14 00:24:51,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:51,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:24:51,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:24:51,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:24:51,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:51,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:51,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:51,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:24:51,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:24:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:51,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:51,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650442238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:51,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:51,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:24:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838456732] [2025-04-14 00:24:51,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:51,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:24:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:51,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:24:51,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:24:51,986 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:51,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:51,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:51,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:51,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:52,257 INFO L116 PetriNetUnfolderBase]: 2018/2760 cut-off events. [2025-04-14 00:24:52,258 INFO L117 PetriNetUnfolderBase]: For 5929/5933 co-relation queries the response was YES. [2025-04-14 00:24:52,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10840 conditions, 2760 events. 2018/2760 cut-off events. For 5929/5933 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11877 event pairs, 337 based on Foata normal form. 78/2818 useless extension candidates. Maximal degree in co-relation 4771. Up to 1153 conditions per place. [2025-04-14 00:24:52,276 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 93 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2025-04-14 00:24:52,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 107 transitions, 835 flow [2025-04-14 00:24:52,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-14 00:24:52,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-14 00:24:52,277 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 271 flow. Second operand 5 states and 103 transitions. [2025-04-14 00:24:52,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 107 transitions, 835 flow [2025-04-14 00:24:52,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 790 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-14 00:24:52,286 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 312 flow [2025-04-14 00:24:52,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-04-14 00:24:52,287 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-14 00:24:52,287 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 312 flow [2025-04-14 00:24:52,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:52,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:52,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:52,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:24:52,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:52,492 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:24:52,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1167789439, now seen corresponding path program 2 times [2025-04-14 00:24:52,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:52,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130237459] [2025-04-14 00:24:52,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:52,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:24:52,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:52,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:52,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:52,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:52,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130237459] [2025-04-14 00:24:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130237459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:24:52,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:24:52,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:24:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521399930] [2025-04-14 00:24:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:24:52,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:24:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:52,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:24:52,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:24:52,604 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:52,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:52,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:52,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:52,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:52,937 INFO L116 PetriNetUnfolderBase]: 1819/2464 cut-off events. [2025-04-14 00:24:52,937 INFO L117 PetriNetUnfolderBase]: For 5931/5935 co-relation queries the response was YES. [2025-04-14 00:24:52,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10460 conditions, 2464 events. 1819/2464 cut-off events. For 5931/5935 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9837 event pairs, 108 based on Foata normal form. 38/2482 useless extension candidates. Maximal degree in co-relation 7041. Up to 1016 conditions per place. [2025-04-14 00:24:52,960 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 90 selfloop transitions, 9 changer transitions 2/105 dead transitions. [2025-04-14 00:24:52,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 105 transitions, 809 flow [2025-04-14 00:24:52,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 00:24:52,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-14 00:24:52,962 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 312 flow. Second operand 5 states and 101 transitions. [2025-04-14 00:24:52,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 105 transitions, 809 flow [2025-04-14 00:24:52,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 800 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:24:52,974 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 316 flow [2025-04-14 00:24:52,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-04-14 00:24:52,975 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-14 00:24:52,975 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 316 flow [2025-04-14 00:24:52,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:52,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:52,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:52,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:24:52,976 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:24:52,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash 975967196, now seen corresponding path program 2 times [2025-04-14 00:24:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:52,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533827404] [2025-04-14 00:24:52,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:52,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:24:52,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:52,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:52,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:53,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533827404] [2025-04-14 00:24:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533827404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:53,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656781220] [2025-04-14 00:24:53,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:53,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:24:53,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:24:53,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:24:53,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:53,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:53,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:53,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:24:53,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:24:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:53,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656781220] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:53,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:24:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51152175] [2025-04-14 00:24:53,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:53,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:24:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:53,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:24:53,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:24:53,327 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:53,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:24:53,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:53,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:53,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:53,543 INFO L116 PetriNetUnfolderBase]: 1745/2404 cut-off events. [2025-04-14 00:24:53,543 INFO L117 PetriNetUnfolderBase]: For 6241/6245 co-relation queries the response was YES. [2025-04-14 00:24:53,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10619 conditions, 2404 events. 1745/2404 cut-off events. For 6241/6245 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10209 event pairs, 303 based on Foata normal form. 75/2459 useless extension candidates. Maximal degree in co-relation 6671. Up to 1314 conditions per place. [2025-04-14 00:24:53,555 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2025-04-14 00:24:53,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 103 transitions, 829 flow [2025-04-14 00:24:53,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-14 00:24:53,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.632258064516129 [2025-04-14 00:24:53,556 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 316 flow. Second operand 5 states and 98 transitions. [2025-04-14 00:24:53,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 103 transitions, 829 flow [2025-04-14 00:24:53,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:24:53,562 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 363 flow [2025-04-14 00:24:53,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-04-14 00:24:53,563 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-04-14 00:24:53,563 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 363 flow [2025-04-14 00:24:53,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:24:53,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:53,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:53,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:24:53,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:53,768 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:24:53,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 273294117, now seen corresponding path program 2 times [2025-04-14 00:24:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:53,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284006126] [2025-04-14 00:24:53,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:53,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:24:53,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:53,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:53,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:53,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:53,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284006126] [2025-04-14 00:24:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284006126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:24:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:24:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:24:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093348397] [2025-04-14 00:24:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:24:53,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:24:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:24:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:24:53,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:53,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:53,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:53,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:53,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:54,007 INFO L116 PetriNetUnfolderBase]: 1515/2039 cut-off events. [2025-04-14 00:24:54,007 INFO L117 PetriNetUnfolderBase]: For 7805/7805 co-relation queries the response was YES. [2025-04-14 00:24:54,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9682 conditions, 2039 events. 1515/2039 cut-off events. For 7805/7805 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8056 event pairs, 89 based on Foata normal form. 34/2071 useless extension candidates. Maximal degree in co-relation 8463. Up to 864 conditions per place. [2025-04-14 00:24:54,018 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 108 selfloop transitions, 9 changer transitions 4/125 dead transitions. [2025-04-14 00:24:54,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 125 transitions, 1122 flow [2025-04-14 00:24:54,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-14 00:24:54,019 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-14 00:24:54,019 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 363 flow. Second operand 5 states and 109 transitions. [2025-04-14 00:24:54,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 125 transitions, 1122 flow [2025-04-14 00:24:54,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 1081 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-14 00:24:54,029 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 365 flow [2025-04-14 00:24:54,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-04-14 00:24:54,030 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-04-14 00:24:54,030 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 365 flow [2025-04-14 00:24:54,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:24:54,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:54,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:54,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:24:54,030 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:24:54,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1809970028, now seen corresponding path program 2 times [2025-04-14 00:24:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:54,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750012008] [2025-04-14 00:24:54,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:54,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:24:54,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:54,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:54,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:54,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750012008] [2025-04-14 00:24:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750012008] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:54,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949142987] [2025-04-14 00:24:54,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:24:54,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:54,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:54,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:24:54,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:24:54,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:24:54,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:24:54,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:24:54,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:54,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:24:54,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:24:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:54,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:54,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949142987] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:54,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:24:54,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64247476] [2025-04-14 00:24:54,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:54,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:24:54,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:54,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:24:54,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:24:54,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:54,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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:24:54,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:54,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:54,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:54,522 INFO L116 PetriNetUnfolderBase]: 1447/1984 cut-off events. [2025-04-14 00:24:54,522 INFO L117 PetriNetUnfolderBase]: For 6931/6931 co-relation queries the response was YES. [2025-04-14 00:24:54,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 1984 events. 1447/1984 cut-off events. For 6931/6931 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8181 event pairs, 375 based on Foata normal form. 68/2044 useless extension candidates. Maximal degree in co-relation 8581. Up to 1150 conditions per place. [2025-04-14 00:24:54,532 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 111 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-04-14 00:24:54,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 1106 flow [2025-04-14 00:24:54,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:24:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:24:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-14 00:24:54,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6838709677419355 [2025-04-14 00:24:54,533 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 365 flow. Second operand 5 states and 106 transitions. [2025-04-14 00:24:54,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 1106 flow [2025-04-14 00:24:54,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 1097 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:24:54,540 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 406 flow [2025-04-14 00:24:54,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2025-04-14 00:24:54,541 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2025-04-14 00:24:54,541 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 406 flow [2025-04-14 00:24:54,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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:24:54,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:24:54,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:24:54,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:24:54,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:54,745 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:24:54,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:24:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1701026351, now seen corresponding path program 1 times [2025-04-14 00:24:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:24:54,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988653497] [2025-04-14 00:24:54,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:54,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:24:54,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:24:54,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:24:54,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:24:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:24:55,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988653497] [2025-04-14 00:24:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988653497] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:24:55,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760175007] [2025-04-14 00:24:55,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:24:55,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:24:55,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:24:55,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:24:55,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:24:55,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:24:55,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:24:55,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:24:55,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:24:55,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:24:55,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:25:38,697 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:26:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:11,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:26:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760175007] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:26:11,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:26:11,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:26:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201790246] [2025-04-14 00:26:11,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:26:11,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:26:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:26:11,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:26:11,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:26:11,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:26:11,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 406 flow. Second operand has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 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:26:11,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:26:11,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:26:11,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:26:15,927 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:18,744 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:22,497 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:24,885 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:28,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:30,467 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:35,312 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:37,355 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:39,010 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:43,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:47,175 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:50,225 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:51,891 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:55,223 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:56,408 INFO L116 PetriNetUnfolderBase]: 3088/4261 cut-off events. [2025-04-14 00:26:56,408 INFO L117 PetriNetUnfolderBase]: For 14005/14005 co-relation queries the response was YES. [2025-04-14 00:26:56,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21408 conditions, 4261 events. 3088/4261 cut-off events. For 14005/14005 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 20094 event pairs, 137 based on Foata normal form. 21/4274 useless extension candidates. Maximal degree in co-relation 19715. Up to 2243 conditions per place. [2025-04-14 00:26:56,432 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 215 selfloop transitions, 100 changer transitions 15/334 dead transitions. [2025-04-14 00:26:56,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 334 transitions, 2831 flow [2025-04-14 00:26:56,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:26:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:26:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 360 transitions. [2025-04-14 00:26:56,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-04-14 00:26:56,434 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 406 flow. Second operand 16 states and 360 transitions. [2025-04-14 00:26:56,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 334 transitions, 2831 flow [2025-04-14 00:26:56,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 334 transitions, 2783 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-04-14 00:26:56,453 INFO L231 Difference]: Finished difference. Result has 93 places, 152 transitions, 1637 flow [2025-04-14 00:26:56,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1637, PETRI_PLACES=93, PETRI_TRANSITIONS=152} [2025-04-14 00:26:56,453 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-04-14 00:26:56,453 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 152 transitions, 1637 flow [2025-04-14 00:26:56,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 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:26:56,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:26:56,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:26:56,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 00:26:56,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-14 00:26:56,655 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:26:56,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:26:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2105856559, now seen corresponding path program 1 times [2025-04-14 00:26:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:26:56,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327821997] [2025-04-14 00:26:56,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:56,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:26:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:26:56,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:26:56,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:56,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:26:57,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:26:57,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327821997] [2025-04-14 00:26:57,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327821997] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:26:57,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671030592] [2025-04-14 00:26:57,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:26:57,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:26:57,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:26:57,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:26:57,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:26:57,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:26:57,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:26:57,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:26:57,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:26:57,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:26:57,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:27:33,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:27:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:27:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671030592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:27:39,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:27:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:27:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309915128] [2025-04-14 00:27:39,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:27:39,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:27:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:27:39,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:27:39,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=168, Unknown=5, NotChecked=0, Total=240 [2025-04-14 00:27:39,586 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:27:39,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 152 transitions, 1637 flow. Second operand has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 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:27:39,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:27:39,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:27:39,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:43,838 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:49,438 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:52,734 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:54,859 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:59,393 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:02,049 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:02,117 INFO L116 PetriNetUnfolderBase]: 4344/5988 cut-off events. [2025-04-14 00:28:02,117 INFO L117 PetriNetUnfolderBase]: For 28635/28635 co-relation queries the response was YES. [2025-04-14 00:28:02,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34666 conditions, 5988 events. 4344/5988 cut-off events. For 28635/28635 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 29515 event pairs, 367 based on Foata normal form. 15/5995 useless extension candidates. Maximal degree in co-relation 32693. Up to 4373 conditions per place. [2025-04-14 00:28:02,150 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 277 selfloop transitions, 100 changer transitions 20/401 dead transitions. [2025-04-14 00:28:02,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 401 transitions, 4278 flow [2025-04-14 00:28:02,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:28:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:28:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 329 transitions. [2025-04-14 00:28:02,152 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6633064516129032 [2025-04-14 00:28:02,152 INFO L175 Difference]: Start difference. First operand has 93 places, 152 transitions, 1637 flow. Second operand 16 states and 329 transitions. [2025-04-14 00:28:02,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 401 transitions, 4278 flow [2025-04-14 00:28:02,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 401 transitions, 4079 flow, removed 97 selfloop flow, removed 1 redundant places. [2025-04-14 00:28:02,206 INFO L231 Difference]: Finished difference. Result has 117 places, 250 transitions, 2815 flow [2025-04-14 00:28:02,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2815, PETRI_PLACES=117, PETRI_TRANSITIONS=250} [2025-04-14 00:28:02,207 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 82 predicate places. [2025-04-14 00:28:02,207 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 250 transitions, 2815 flow [2025-04-14 00:28:02,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 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:28:02,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:28:02,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:28:02,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 00:28:02,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:28:02,408 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:28:02,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:28:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 992097259, now seen corresponding path program 2 times [2025-04-14 00:28:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:28:02,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264349873] [2025-04-14 00:28:02,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:28:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:28:02,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:28:02,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:28:02,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:28:02,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:02,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:28:02,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264349873] [2025-04-14 00:28:02,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264349873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:28:02,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28106078] [2025-04-14 00:28:02,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:28:02,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:28:02,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:28:02,591 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:28:02,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 00:28:02,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:28:02,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:28:02,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:28:02,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:28:02,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:28:02,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:28:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:26,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:28:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:28:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28106078] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:28:31,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:28:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-04-14 00:28:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764274298] [2025-04-14 00:28:31,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:28:31,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:28:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:28:31,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:28:31,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=103, Unknown=3, NotChecked=0, Total=156 [2025-04-14 00:28:31,238 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:28:31,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 250 transitions, 2815 flow. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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:28:31,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:28:31,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:28:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:28:33,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:37,857 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:28:39,062 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:00,119 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:03,115 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:06,302 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:10,309 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:14,314 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:23,698 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:28,276 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:32,813 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:36,825 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:43,235 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:47,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:51,389 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:55,545 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:59,609 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:03,648 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:08,478 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:12,493 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:15,471 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:19,961 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:23,969 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:28,357 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:32,364 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:35,840 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:30:37,023 INFO L116 PetriNetUnfolderBase]: 6160/8470 cut-off events. [2025-04-14 00:30:37,024 INFO L117 PetriNetUnfolderBase]: For 57856/57856 co-relation queries the response was YES. [2025-04-14 00:30:37,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53990 conditions, 8470 events. 6160/8470 cut-off events. For 57856/57856 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 43489 event pairs, 436 based on Foata normal form. 34/8496 useless extension candidates. Maximal degree in co-relation 53421. Up to 6028 conditions per place. [2025-04-14 00:30:37,073 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 406 selfloop transitions, 158 changer transitions 28/596 dead transitions. [2025-04-14 00:30:37,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 596 transitions, 7108 flow [2025-04-14 00:30:37,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:30:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:30:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 447 transitions. [2025-04-14 00:30:37,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.655425219941349 [2025-04-14 00:30:37,076 INFO L175 Difference]: Start difference. First operand has 117 places, 250 transitions, 2815 flow. Second operand 22 states and 447 transitions. [2025-04-14 00:30:37,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 596 transitions, 7108 flow [2025-04-14 00:30:37,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 596 transitions, 6647 flow, removed 228 selfloop flow, removed 1 redundant places. [2025-04-14 00:30:37,213 INFO L231 Difference]: Finished difference. Result has 151 places, 386 transitions, 4726 flow [2025-04-14 00:30:37,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2422, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4726, PETRI_PLACES=151, PETRI_TRANSITIONS=386} [2025-04-14 00:30:37,215 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 116 predicate places. [2025-04-14 00:30:37,215 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 386 transitions, 4726 flow [2025-04-14 00:30:37,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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:30:37,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:30:37,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:30:37,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 00:30:37,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:30:37,420 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:30:37,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:30:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1857001475, now seen corresponding path program 2 times [2025-04-14 00:30:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:30:37,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858509803] [2025-04-14 00:30:37,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:30:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:30:37,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:30:37,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:30:37,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:30:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:30:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:30:37,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:30:37,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858509803] [2025-04-14 00:30:37,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858509803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:30:37,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560391891] [2025-04-14 00:30:37,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:30:37,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:30:37,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:30:37,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:30:37,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 00:30:37,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:30:37,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:30:37,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:30:37,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:30:37,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:30:37,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:31:10,999 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:31:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:31:27,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:31:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:31:43,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560391891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:31:43,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:31:43,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 6, 5] total 12 [2025-04-14 00:31:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123252038] [2025-04-14 00:31:43,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:31:43,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 00:31:43,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:31:43,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 00:31:43,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=116, Unknown=11, NotChecked=0, Total=182 [2025-04-14 00:31:43,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:31:43,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 386 transitions, 4726 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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:31:43,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:31:43,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:31:43,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:31:52,310 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:31:56,331 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:00,333 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:04,337 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:08,495 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:12,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:16,508 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:29,401 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:30,587 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:35,791 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:39,799 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:47,210 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:53,761 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:06,471 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:10,479 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:18,556 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:22,805 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:27,512 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:31,517 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:34,944 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:39,788 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:40,842 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:42,751 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:47,835 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:56,102 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:57,699 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:01,738 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:07,814 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:11,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:16,889 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:20,892 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:23,370 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:27,388 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:32,568 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:36,582 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:40,618 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:43,779 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:46,514 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:51,010 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:55,014 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:59,018 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:03,722 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:07,756 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:12,405 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:16,411 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:21,564 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:25,569 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:29,573 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:35,881 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:39,885 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:44,256 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:49,372 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:53,390 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:59,290 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:01,273 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:01,309 INFO L116 PetriNetUnfolderBase]: 8550/11890 cut-off events. [2025-04-14 00:36:01,309 INFO L117 PetriNetUnfolderBase]: For 114766/114766 co-relation queries the response was YES. [2025-04-14 00:36:01,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80159 conditions, 11890 events. 8550/11890 cut-off events. For 114766/114766 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 65795 event pairs, 484 based on Foata normal form. 60/11942 useless extension candidates. Maximal degree in co-relation 79551. Up to 8280 conditions per place. [2025-04-14 00:36:01,427 INFO L140 encePairwiseOnDemand]: 16/31 looper letters, 560 selfloop transitions, 179 changer transitions 23/766 dead transitions. [2025-04-14 00:36:01,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 766 transitions, 9508 flow [2025-04-14 00:36:01,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:36:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:36:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 457 transitions. [2025-04-14 00:36:01,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7370967741935484 [2025-04-14 00:36:01,429 INFO L175 Difference]: Start difference. First operand has 151 places, 386 transitions, 4726 flow. Second operand 20 states and 457 transitions. [2025-04-14 00:36:01,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 766 transitions, 9508 flow [2025-04-14 00:36:01,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 766 transitions, 8759 flow, removed 372 selfloop flow, removed 1 redundant places. [2025-04-14 00:36:01,863 INFO L231 Difference]: Finished difference. Result has 183 places, 529 transitions, 6582 flow [2025-04-14 00:36:01,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4033, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6582, PETRI_PLACES=183, PETRI_TRANSITIONS=529} [2025-04-14 00:36:01,864 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 148 predicate places. [2025-04-14 00:36:01,864 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 529 transitions, 6582 flow [2025-04-14 00:36:01,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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:36:01,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:01,865 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:01,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 00:36:02,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 00:36:02,069 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:36:02,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash -728183977, now seen corresponding path program 3 times [2025-04-14 00:36:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:02,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346845291] [2025-04-14 00:36:02,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:36:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:02,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:36:02,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:36:02,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:36:02,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:36:02,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:02,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346845291] [2025-04-14 00:36:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346845291] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:02,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622957375] [2025-04-14 00:36:02,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:36:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:02,238 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:36:02,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 00:36:02,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:36:02,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:36:02,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:36:02,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:02,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:36:02,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:36:02,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:36:03,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622957375] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:03,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:03,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-14 00:36:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821616201] [2025-04-14 00:36:03,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:03,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:36:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:03,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:36:03,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:36:03,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:36:03,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 529 transitions, 6582 flow. Second operand has 16 states, 16 states have (on average 11.625) internal successors, (186), 16 states have internal predecessors, (186), 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:36:03,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:03,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:36:03,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:06,323 INFO L116 PetriNetUnfolderBase]: 10138/14055 cut-off events. [2025-04-14 00:36:06,323 INFO L117 PetriNetUnfolderBase]: For 197842/197844 co-relation queries the response was YES. [2025-04-14 00:36:06,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105962 conditions, 14055 events. 10138/14055 cut-off events. For 197842/197844 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 79240 event pairs, 345 based on Foata normal form. 144/14195 useless extension candidates. Maximal degree in co-relation 105311. Up to 3752 conditions per place. [2025-04-14 00:36:06,463 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 786 selfloop transitions, 171 changer transitions 18/979 dead transitions. [2025-04-14 00:36:06,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 979 transitions, 13936 flow [2025-04-14 00:36:06,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:36:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:36:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 270 transitions. [2025-04-14 00:36:06,467 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-04-14 00:36:06,467 INFO L175 Difference]: Start difference. First operand has 183 places, 529 transitions, 6582 flow. Second operand 12 states and 270 transitions. [2025-04-14 00:36:06,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 979 transitions, 13936 flow [2025-04-14 00:36:07,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 979 transitions, 13211 flow, removed 359 selfloop flow, removed 1 redundant places. [2025-04-14 00:36:07,360 INFO L231 Difference]: Finished difference. Result has 198 places, 562 transitions, 7190 flow [2025-04-14 00:36:07,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6081, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7190, PETRI_PLACES=198, PETRI_TRANSITIONS=562} [2025-04-14 00:36:07,361 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 163 predicate places. [2025-04-14 00:36:07,361 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 562 transitions, 7190 flow [2025-04-14 00:36:07,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.625) internal successors, (186), 16 states have internal predecessors, (186), 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:36:07,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:36:07,361 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:36:07,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 00:36:07,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-14 00:36:07,562 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:36:07,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:36:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1244376377, now seen corresponding path program 3 times [2025-04-14 00:36:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:36:07,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170175241] [2025-04-14 00:36:07,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:36:07,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:36:07,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:36:07,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:36:07,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:36:07,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:36:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:36:07,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170175241] [2025-04-14 00:36:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170175241] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:36:07,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800668469] [2025-04-14 00:36:07,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:36:07,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:36:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:36:07,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:36:07,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 00:36:07,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:36:07,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:36:07,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:36:07,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:36:07,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 00:36:07,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:36:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:36:13,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:36:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:36:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800668469] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:36:14,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:36:14,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-14 00:36:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997694117] [2025-04-14 00:36:14,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:36:14,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:36:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:36:14,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:36:14,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:36:14,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:36:14,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 562 transitions, 7190 flow. Second operand has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 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:36:14,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:36:14,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:36:14,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:36:23,706 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:27,777 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:33,559 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:37,675 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:42,764 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:46,767 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:51,341 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:58,419 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:02,424 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:07,334 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:12,578 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:16,585 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:20,593 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:24,597 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:28,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:32,606 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:36,610 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:40,743 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:44,749 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:48,753 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:52,759 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:37:56,763 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:00,772 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:04,777 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:12,506 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:16,525 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:20,531 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:25,150 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:29,169 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:34,302 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:38,307 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:42,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:46,320 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:50,326 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:54,330 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:38:58,335 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:02,342 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:06,350 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:10,354 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:14,359 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:18,363 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:22,372 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:39:26,385 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-14 00:39:26,425 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:39:26,448 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:39:26,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:39:26,998 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 00:39:27,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 00:39:27,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 00:39:27,199 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. [2025-04-14 00:39:27,201 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-14 00:39:27,201 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 00:39:27,201 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-14 00:39:27,201 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-14 00:39:27,202 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1] [2025-04-14 00:39:27,207 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:39:27,207 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:39:27,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:39:27 BasicIcfg [2025-04-14 00:39:27,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:39:27,212 INFO L158 Benchmark]: Toolchain (without parser) took 878566.12ms. Allocated memory was 167.8MB in the beginning and 922.7MB in the end (delta: 755.0MB). Free memory was 119.8MB in the beginning and 590.6MB in the end (delta: -470.8MB). Peak memory consumption was 281.7MB. Max. memory is 8.0GB. [2025-04-14 00:39:27,213 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:39:27,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.55ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 104.1MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:39:27,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.09ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:39:27,213 INFO L158 Benchmark]: Boogie Preprocessor took 28.27ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.7MB in the end (delta: 888.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:39:27,213 INFO L158 Benchmark]: IcfgBuilder took 382.29ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 64.8MB in the end (delta: 36.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 00:39:27,213 INFO L158 Benchmark]: TraceAbstraction took 877871.18ms. Allocated memory was 167.8MB in the beginning and 922.7MB in the end (delta: 755.0MB). Free memory was 63.9MB in the beginning and 590.6MB in the end (delta: -526.7MB). Peak memory consumption was 227.2MB. Max. memory is 8.0GB. [2025-04-14 00:39:27,214 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.55ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 104.1MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.09ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.27ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.7MB in the end (delta: 888.9kB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 382.29ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 64.8MB in the end (delta: 36.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 877871.18ms. Allocated memory was 167.8MB in the beginning and 922.7MB in the end (delta: 755.0MB). Free memory was 63.9MB in the beginning and 590.6MB in the end (delta: -526.7MB). Peak memory consumption was 227.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 44 locations, 51 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: 877.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 650.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 110 mSolverCounterUnknown, 1296 SdHoareTripleChecker+Valid, 566.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1296 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 565.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4860 IncrementalHoareTripleChecker+Invalid, 5133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 0 mSDtfsCounter, 4860 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 399 SyntacticMatches, 12 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 234.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7190occurred in iteration=14, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 223.6s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 13514 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1574 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 9/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown