/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-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:21:52,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:21:52,343 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:21:52,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:21:52,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:21:52,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:21:52,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:21:52,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:21:52,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:21:52,367 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:21:52,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:21:52,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:21:52,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:21:52,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:21:52,368 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:21:52,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:21:52,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:21:52,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:21:52,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:21:52,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:21:52,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:21:52,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:21:52,371 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:21:52,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:21:52,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:21:52,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:21:52,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:21:52,611 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:21:52,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2025-04-14 00:21:53,941 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44cb973f7/6f67c3cced4b45bb8725d246aad75f84/FLAGe9d78bb1e [2025-04-14 00:21:54,116 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:21:54,117 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2025-04-14 00:21:54,123 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44cb973f7/6f67c3cced4b45bb8725d246aad75f84/FLAGe9d78bb1e [2025-04-14 00:21:54,943 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44cb973f7/6f67c3cced4b45bb8725d246aad75f84 [2025-04-14 00:21:54,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:21:54,946 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:21:54,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:21:54,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:21:54,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:21:54,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:21:54" (1/1) ... [2025-04-14 00:21:54,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25785f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:54, skipping insertion in model container [2025-04-14 00:21:54,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:21:54" (1/1) ... [2025-04-14 00:21:54,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:21:55,093 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-exp2x3.wvr.c[2289,2302] [2025-04-14 00:21:55,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:21:55,102 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:21:55,119 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-exp2x3.wvr.c[2289,2302] [2025-04-14 00:21:55,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:21:55,132 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:21:55,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55 WrapperNode [2025-04-14 00:21:55,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:21:55,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:21:55,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:21:55,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:21:55,139 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:21:55" (1/1) ... [2025-04-14 00:21:55,144 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:21:55" (1/1) ... [2025-04-14 00:21:55,164 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-14 00:21:55,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:21:55,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:21:55,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:21:55,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:21:55,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,187 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:21:55,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:21:55,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:21:55,196 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:21:55,196 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:21:55,197 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (1/1) ... [2025-04-14 00:21:55,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:21:55,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:55,222 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:21:55,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:21:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:21:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:21:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:21:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:21:55,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:21:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:21:55,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:21:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:21:55,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:21:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:21:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:21:55,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:21:55,240 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:21:55,303 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:21:55,304 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:21:55,454 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:21:55,455 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:21:55,455 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:21:55,582 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:21:55,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:21:55 BoogieIcfgContainer [2025-04-14 00:21:55,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:21:55,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:21:55,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:21:55,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:21:55,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:21:54" (1/3) ... [2025-04-14 00:21:55,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ce2247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:21:55, skipping insertion in model container [2025-04-14 00:21:55,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:21:55" (2/3) ... [2025-04-14 00:21:55,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ce2247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:21:55, skipping insertion in model container [2025-04-14 00:21:55,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:21:55" (3/3) ... [2025-04-14 00:21:55,589 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2025-04-14 00:21:55,600 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:21:55,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x3.wvr.c that has 5 procedures, 28 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 00:21:55,601 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:21:55,653 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:21:55,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2025-04-14 00:21:55,701 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-14 00:21:55,702 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:21:55,704 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 3. Compared 19 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:21:55,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2025-04-14 00:21:55,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-14 00:21:55,715 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:21:55,723 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;@196bcf8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:21:55,723 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:21:55,735 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:21:55,735 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-14 00:21:55,735 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:21:55,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:55,736 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:21:55,736 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:21:55,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 404202238, now seen corresponding path program 1 times [2025-04-14 00:21:55,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:55,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856410035] [2025-04-14 00:21:55,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:21:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:55,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:21:55,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:21:55,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:55,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:21:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:56,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856410035] [2025-04-14 00:21:56,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856410035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:21:56,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:21:56,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:21:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133650033] [2025-04-14 00:21:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:21:56,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:21:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:56,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:21:56,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:21:56,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:56,129 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:21:56,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:56,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:56,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:56,403 INFO L116 PetriNetUnfolderBase]: 1367/1731 cut-off events. [2025-04-14 00:21:56,403 INFO L117 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-04-14 00:21:56,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1731 events. 1367/1731 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5579 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:21:56,416 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2025-04-14 00:21:56,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 217 flow [2025-04-14 00:21:56,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:21:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:21:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-14 00:21:56,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-14 00:21:56,428 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:21:56,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 217 flow [2025-04-14 00:21:56,434 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:21:56,437 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 93 flow [2025-04-14 00:21:56,439 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:21:56,441 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-14 00:21:56,441 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 93 flow [2025-04-14 00:21:56,441 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:21:56,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:56,441 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:21:56,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:21:56,442 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:21:56,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash -942678840, now seen corresponding path program 1 times [2025-04-14 00:21:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:56,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972218892] [2025-04-14 00:21:56,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:21:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:56,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:21:56,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:56,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:56,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:56,569 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:21:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:56,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972218892] [2025-04-14 00:21:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972218892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:21:56,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:21:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:21:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225599305] [2025-04-14 00:21:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:21:56,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:21:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:56,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:21:56,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:21:56,571 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:56,571 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:21:56,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:56,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:56,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:56,808 INFO L116 PetriNetUnfolderBase]: 1593/2036 cut-off events. [2025-04-14 00:21:56,808 INFO L117 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2025-04-14 00:21:56,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5070 conditions, 2036 events. 1593/2036 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7028 event pairs, 113 based on Foata normal form. 34/2066 useless extension candidates. Maximal degree in co-relation 1272. Up to 842 conditions per place. [2025-04-14 00:21:56,824 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 66 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-04-14 00:21:56,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 80 transitions, 389 flow [2025-04-14 00:21:56,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:21:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:21:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-14 00:21:56,826 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-14 00:21:56,827 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 93 flow. Second operand 5 states and 110 transitions. [2025-04-14 00:21:56,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 80 transitions, 389 flow [2025-04-14 00:21:56,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 80 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:21:56,828 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 153 flow [2025-04-14 00:21:56,828 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:21:56,829 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-14 00:21:56,829 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 153 flow [2025-04-14 00:21:56,829 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:21:56,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:56,831 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:21:56,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:21:56,831 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:21:56,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 536497097, now seen corresponding path program 1 times [2025-04-14 00:21:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:56,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029459697] [2025-04-14 00:21:56,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:21:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:56,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:21:56,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:56,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:56,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:56,919 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:21:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:56,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029459697] [2025-04-14 00:21:56,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029459697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:21:56,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:21:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:21:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172388102] [2025-04-14 00:21:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:21:56,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:21:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:56,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:21:56,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:21:56,920 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:56,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 153 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:21:56,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:56,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:56,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:57,115 INFO L116 PetriNetUnfolderBase]: 1547/1990 cut-off events. [2025-04-14 00:21:57,115 INFO L117 PetriNetUnfolderBase]: For 1776/1776 co-relation queries the response was YES. [2025-04-14 00:21:57,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 1990 events. 1547/1990 cut-off events. For 1776/1776 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7002 event pairs, 95 based on Foata normal form. 46/2032 useless extension candidates. Maximal degree in co-relation 2828. Up to 812 conditions per place. [2025-04-14 00:21:57,126 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 65 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2025-04-14 00:21:57,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 77 transitions, 410 flow [2025-04-14 00:21:57,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:21:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:21:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-14 00:21:57,130 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6967741935483871 [2025-04-14 00:21:57,130 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 153 flow. Second operand 5 states and 108 transitions. [2025-04-14 00:21:57,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 77 transitions, 410 flow [2025-04-14 00:21:57,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 77 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:21:57,133 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 167 flow [2025-04-14 00:21:57,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-04-14 00:21:57,133 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-04-14 00:21:57,133 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 167 flow [2025-04-14 00:21:57,134 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:21:57,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:57,134 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:21:57,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:21:57,134 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:21:57,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1921170390, now seen corresponding path program 1 times [2025-04-14 00:21:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:57,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476765858] [2025-04-14 00:21:57,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:21:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:21:57,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:57,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:57,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:57,219 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:21:57,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:57,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476765858] [2025-04-14 00:21:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476765858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:57,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172850132] [2025-04-14 00:21:57,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:21:57,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:57,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:57,222 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:21:57,235 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:21:57,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:21:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:57,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:57,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:21:57,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:57,432 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:21:57,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:57,497 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:21:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172850132] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:57,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:21:57,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505165089] [2025-04-14 00:21:57,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:57,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:21:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:57,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:21:57,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:21:57,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:57,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 167 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:21:57,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:57,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:57,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:57,758 INFO L116 PetriNetUnfolderBase]: 1869/2492 cut-off events. [2025-04-14 00:21:57,758 INFO L117 PetriNetUnfolderBase]: For 4481/4481 co-relation queries the response was YES. [2025-04-14 00:21:57,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8300 conditions, 2492 events. 1869/2492 cut-off events. For 4481/4481 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10036 event pairs, 284 based on Foata normal form. 64/2532 useless extension candidates. Maximal degree in co-relation 4036. Up to 1031 conditions per place. [2025-04-14 00:21:57,775 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 79 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-04-14 00:21:57,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 91 transitions, 620 flow [2025-04-14 00:21:57,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:21:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:21:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-14 00:21:57,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-14 00:21:57,776 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 167 flow. Second operand 5 states and 103 transitions. [2025-04-14 00:21:57,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 91 transitions, 620 flow [2025-04-14 00:21:57,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 91 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:21:57,781 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 215 flow [2025-04-14 00:21:57,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-04-14 00:21:57,783 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-04-14 00:21:57,783 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 215 flow [2025-04-14 00:21:57,783 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:21:57,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:57,783 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:21:57,790 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:21:57,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:57,988 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:21:57,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash -864978612, now seen corresponding path program 2 times [2025-04-14 00:21:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:57,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571165234] [2025-04-14 00:21:57,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:57,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:21:58,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:58,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:58,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:58,076 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:21:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:58,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571165234] [2025-04-14 00:21:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571165234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:58,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565595669] [2025-04-14 00:21:58,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:58,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:58,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:58,079 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:21:58,082 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:21:58,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:21:58,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:58,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:58,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:21:58,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:58,223 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:21:58,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:58,256 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:21:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565595669] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:58,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:21:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931567565] [2025-04-14 00:21:58,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:58,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:21:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:58,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:21:58,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:21:58,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:58,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:58,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:58,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:58,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:58,481 INFO L116 PetriNetUnfolderBase]: 1783/2388 cut-off events. [2025-04-14 00:21:58,482 INFO L117 PetriNetUnfolderBase]: For 4809/4809 co-relation queries the response was YES. [2025-04-14 00:21:58,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9288 conditions, 2388 events. 1783/2388 cut-off events. For 4809/4809 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9903 event pairs, 434 based on Foata normal form. 90/2470 useless extension candidates. Maximal degree in co-relation 4805. Up to 1360 conditions per place. [2025-04-14 00:21:58,496 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 83 selfloop transitions, 8 changer transitions 0/95 dead transitions. [2025-04-14 00:21:58,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 646 flow [2025-04-14 00:21:58,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:21:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:21:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-14 00:21:58,497 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-14 00:21:58,497 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 215 flow. Second operand 5 states and 109 transitions. [2025-04-14 00:21:58,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 646 flow [2025-04-14 00:21:58,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:21:58,504 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 265 flow [2025-04-14 00:21:58,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-04-14 00:21:58,505 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-14 00:21:58,505 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 265 flow [2025-04-14 00:21:58,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:58,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:58,505 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:21:58,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:21:58,710 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:21:58,710 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:21:58,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1608453699, now seen corresponding path program 1 times [2025-04-14 00:21:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:58,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589398590] [2025-04-14 00:21:58,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:21:58,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:58,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:21:58,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:58,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:21:58,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:58,786 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:21:58,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:58,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589398590] [2025-04-14 00:21:58,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589398590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:21:58,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:21:58,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:21:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778638889] [2025-04-14 00:21:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:21:58,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:21:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:58,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:21:58,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:21:58,787 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:58,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 265 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:21:58,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:58,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:58,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:58,989 INFO L116 PetriNetUnfolderBase]: 1750/2360 cut-off events. [2025-04-14 00:21:58,989 INFO L117 PetriNetUnfolderBase]: For 7552/7556 co-relation queries the response was YES. [2025-04-14 00:21:59,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10006 conditions, 2360 events. 1750/2360 cut-off events. For 7552/7556 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9330 event pairs, 71 based on Foata normal form. 34/2374 useless extension candidates. Maximal degree in co-relation 6193. Up to 983 conditions per place. [2025-04-14 00:21:59,022 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 93 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2025-04-14 00:21:59,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 107 transitions, 883 flow [2025-04-14 00:21:59,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:21:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:21:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 00:21:59,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-14 00:21:59,023 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 265 flow. Second operand 5 states and 101 transitions. [2025-04-14 00:21:59,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 107 transitions, 883 flow [2025-04-14 00:21:59,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 107 transitions, 858 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 00:21:59,030 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 319 flow [2025-04-14 00:21:59,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-04-14 00:21:59,031 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-14 00:21:59,031 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 319 flow [2025-04-14 00:21:59,031 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:21:59,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:59,031 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:21:59,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:21:59,031 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:21:59,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1213635565, now seen corresponding path program 2 times [2025-04-14 00:21:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:59,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011618266] [2025-04-14 00:21:59,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:59,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:21:59,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:59,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:59,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:59,099 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:21:59,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:59,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011618266] [2025-04-14 00:21:59,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011618266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:21:59,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977843408] [2025-04-14 00:21:59,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:59,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:21:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:21:59,101 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:21:59,103 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:21:59,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:21:59,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:59,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:59,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:59,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:21:59,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:21:59,281 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:21:59,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:21:59,334 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:21:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977843408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:21:59,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:21:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:21:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679811254] [2025-04-14 00:21:59,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:21:59,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:21:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:59,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:21:59,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:21:59,336 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:59,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:59,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:59,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:59,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:59,539 INFO L116 PetriNetUnfolderBase]: 1688/2310 cut-off events. [2025-04-14 00:21:59,539 INFO L117 PetriNetUnfolderBase]: For 7507/7511 co-relation queries the response was YES. [2025-04-14 00:21:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10326 conditions, 2310 events. 1688/2310 cut-off events. For 7507/7511 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9546 event pairs, 258 based on Foata normal form. 63/2353 useless extension candidates. Maximal degree in co-relation 6467. Up to 1365 conditions per place. [2025-04-14 00:21:59,556 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-04-14 00:21:59,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 889 flow [2025-04-14 00:21:59,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:21:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:21:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-14 00:21:59,558 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.632258064516129 [2025-04-14 00:21:59,558 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 319 flow. Second operand 5 states and 98 transitions. [2025-04-14 00:21:59,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 889 flow [2025-04-14 00:21:59,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 874 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:21:59,565 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 358 flow [2025-04-14 00:21:59,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-04-14 00:21:59,565 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-04-14 00:21:59,565 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 358 flow [2025-04-14 00:21:59,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:21:59,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:21:59,565 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:21:59,571 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:21:59,766 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:21:59,766 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:21:59,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:21:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2066144736, now seen corresponding path program 2 times [2025-04-14 00:21:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:21:59,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039266440] [2025-04-14 00:21:59,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:21:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:21:59,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:21:59,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:21:59,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:21:59,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:21:59,828 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:21:59,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:21:59,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039266440] [2025-04-14 00:21:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039266440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:21:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:21:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:21:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501070139] [2025-04-14 00:21:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:21:59,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:21:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:21:59,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:21:59,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:21:59,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:21:59,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 358 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:21:59,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:21:59,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:21:59,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:21:59,995 INFO L116 PetriNetUnfolderBase]: 1515/2057 cut-off events. [2025-04-14 00:21:59,995 INFO L117 PetriNetUnfolderBase]: For 7267/7271 co-relation queries the response was YES. [2025-04-14 00:21:59,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9726 conditions, 2057 events. 1515/2057 cut-off events. For 7267/7271 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7923 event pairs, 75 based on Foata normal form. 32/2069 useless extension candidates. Maximal degree in co-relation 8430. Up to 864 conditions per place. [2025-04-14 00:22:00,007 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 9 changer transitions 4/108 dead transitions. [2025-04-14 00:22:00,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 916 flow [2025-04-14 00:22:00,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:22:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:22:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 00:22:00,009 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-14 00:22:00,009 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 358 flow. Second operand 5 states and 101 transitions. [2025-04-14 00:22:00,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 916 flow [2025-04-14 00:22:00,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 896 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 00:22:00,017 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 353 flow [2025-04-14 00:22:00,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=353, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-04-14 00:22:00,017 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-04-14 00:22:00,018 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 353 flow [2025-04-14 00:22:00,018 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:22:00,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:00,018 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:22:00,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:22:00,018 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:22:00,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash -998594527, now seen corresponding path program 2 times [2025-04-14 00:22:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:00,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274819634] [2025-04-14 00:22:00,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:22:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:00,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:22:00,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:22:00,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:22:00,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:00,076 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:22:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:00,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274819634] [2025-04-14 00:22:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274819634] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:00,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245597837] [2025-04-14 00:22:00,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:22:00,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:00,079 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:22:00,080 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:22:00,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:22:00,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:22:00,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:22:00,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:00,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:22:00,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:22:00,205 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:22:00,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:22:00,242 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:22:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245597837] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:22:00,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:22:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-14 00:22:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209114869] [2025-04-14 00:22:00,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:22:00,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:22:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:22:00,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:22:00,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:22:00,244 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:22:00,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 353 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:00,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:22:00,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:22:00,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:22:00,449 INFO L116 PetriNetUnfolderBase]: 1447/1984 cut-off events. [2025-04-14 00:22:00,449 INFO L117 PetriNetUnfolderBase]: For 7072/7072 co-relation queries the response was YES. [2025-04-14 00:22:00,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9560 conditions, 1984 events. 1447/1984 cut-off events. For 7072/7072 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8190 event pairs, 375 based on Foata normal form. 68/2044 useless extension candidates. Maximal degree in co-relation 8218. Up to 1150 conditions per place. [2025-04-14 00:22:00,459 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 111 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-04-14 00:22:00,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 123 transitions, 1073 flow [2025-04-14 00:22:00,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:22:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:22:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-14 00:22:00,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6838709677419355 [2025-04-14 00:22:00,461 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 353 flow. Second operand 5 states and 106 transitions. [2025-04-14 00:22:00,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 123 transitions, 1073 flow [2025-04-14 00:22:00,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 1040 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 00:22:00,469 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 399 flow [2025-04-14 00:22:00,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=63, 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=399, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-04-14 00:22:00,470 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2025-04-14 00:22:00,470 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 399 flow [2025-04-14 00:22:00,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:22:00,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:22:00,471 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:22:00,477 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:22:00,671 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:22:00,671 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:22:00,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:22:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1472560155, now seen corresponding path program 1 times [2025-04-14 00:22:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:22:00,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309568377] [2025-04-14 00:22:00,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:22:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:22:00,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:22:00,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:22:00,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:22:00,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:01,076 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:22:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:22:01,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309568377] [2025-04-14 00:22:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309568377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:22:01,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86280403] [2025-04-14 00:22:01,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:22:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:22:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:22:01,078 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:22:01,080 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:22:01,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:22:01,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:22:01,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:22:01,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:22:01,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:22:01,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:23:26,826 WARN L286 SmtUtils]: Spent 11.99s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:23:36,495 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:24:01,391 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:01,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:24:19,332 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:19,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86280403] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:24:19,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:24:19,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:24:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634396090] [2025-04-14 00:24:19,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:24:19,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:24:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:24:19,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:24:19,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=168, Unknown=12, NotChecked=0, Total=240 [2025-04-14 00:24:19,334 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:24:19,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 399 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:24:19,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:24:19,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:24:19,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:24:21,327 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:30,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:24:34,988 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:24:38,990 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:24:42,994 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:24:46,997 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:24:59,674 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:25:01,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:25:07,161 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:25:22,610 WARN L286 SmtUtils]: Spent 11.01s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:25:25,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:25:29,293 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:25:33,295 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:25:37,298 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:25:41,300 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:25:45,303 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:25:49,305 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:25:53,308 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:25:57,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:26:01,313 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:05,315 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:09,318 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:13,322 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:17,324 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:21,326 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:22,383 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:27,715 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:31,930 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:34,272 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,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:26:43,785 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,897 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,574 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:52,089 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:56,215 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:57,396 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:26:58,839 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:02,211 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:27:06,278 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:06,668 INFO L116 PetriNetUnfolderBase]: 3141/4333 cut-off events. [2025-04-14 00:27:06,668 INFO L117 PetriNetUnfolderBase]: For 15329/15329 co-relation queries the response was YES. [2025-04-14 00:27:06,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22387 conditions, 4333 events. 3141/4333 cut-off events. For 15329/15329 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 20341 event pairs, 137 based on Foata normal form. 20/4345 useless extension candidates. Maximal degree in co-relation 20705. Up to 2251 conditions per place. [2025-04-14 00:27:06,694 INFO L140 encePairwiseOnDemand]: 15/31 looper letters, 219 selfloop transitions, 110 changer transitions 15/348 dead transitions. [2025-04-14 00:27:06,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 348 transitions, 2916 flow [2025-04-14 00:27:06,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:27:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:27:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 380 transitions. [2025-04-14 00:27:06,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7210626185958254 [2025-04-14 00:27:06,697 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 399 flow. Second operand 17 states and 380 transitions. [2025-04-14 00:27:06,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 348 transitions, 2916 flow [2025-04-14 00:27:06,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 348 transitions, 2895 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 00:27:06,712 INFO L231 Difference]: Finished difference. Result has 95 places, 162 transitions, 1738 flow [2025-04-14 00:27:06,712 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1738, PETRI_PLACES=95, PETRI_TRANSITIONS=162} [2025-04-14 00:27:06,713 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2025-04-14 00:27:06,714 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 162 transitions, 1738 flow [2025-04-14 00:27:06,714 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:27:06,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:06,714 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:27:06,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:27:06,914 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:27:06,914 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:27:06,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:06,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1633312513, now seen corresponding path program 1 times [2025-04-14 00:27:06,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:06,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257729104] [2025-04-14 00:27:06,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:27:06,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:06,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:27:06,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:27:06,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:27:06,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:07,262 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:07,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:07,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257729104] [2025-04-14 00:27:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257729104] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:07,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747038216] [2025-04-14 00:27:07,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:27:07,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:07,264 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:27:07,264 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:27:07,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:27:07,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:27:07,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:27:07,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:07,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:27:07,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:27:09,891 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:09,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:27:14,374 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:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747038216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:27:14,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:27:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:27:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309353007] [2025-04-14 00:27:14,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:27:14,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:27:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:27:14,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:27:14,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=167, Unknown=1, NotChecked=0, Total=240 [2025-04-14 00:27:14,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:27:14,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 162 transitions, 1738 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:14,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:27:14,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:27:14,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:27:17,610 INFO L116 PetriNetUnfolderBase]: 4383/6047 cut-off events. [2025-04-14 00:27:17,610 INFO L117 PetriNetUnfolderBase]: For 34102/34118 co-relation queries the response was YES. [2025-04-14 00:27:17,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37025 conditions, 6047 events. 4383/6047 cut-off events. For 34102/34118 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 29903 event pairs, 323 based on Foata normal form. 15/6050 useless extension candidates. Maximal degree in co-relation 36013. Up to 4429 conditions per place. [2025-04-14 00:27:17,646 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 287 selfloop transitions, 100 changer transitions 20/411 dead transitions. [2025-04-14 00:27:17,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 411 transitions, 4493 flow [2025-04-14 00:27:17,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:27:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:27:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 329 transitions. [2025-04-14 00:27:17,648 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6633064516129032 [2025-04-14 00:27:17,648 INFO L175 Difference]: Start difference. First operand has 95 places, 162 transitions, 1738 flow. Second operand 16 states and 329 transitions. [2025-04-14 00:27:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 411 transitions, 4493 flow [2025-04-14 00:27:17,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 411 transitions, 4214 flow, removed 137 selfloop flow, removed 1 redundant places. [2025-04-14 00:27:17,715 INFO L231 Difference]: Finished difference. Result has 119 places, 260 transitions, 2848 flow [2025-04-14 00:27:17,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2848, PETRI_PLACES=119, PETRI_TRANSITIONS=260} [2025-04-14 00:27:17,716 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2025-04-14 00:27:17,716 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 260 transitions, 2848 flow [2025-04-14 00:27:17,717 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:27:17,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:27:17,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:27:17,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:27:17,918 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:27:17,918 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:27:17,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:27:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash -959726975, now seen corresponding path program 2 times [2025-04-14 00:27:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:27:17,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482438021] [2025-04-14 00:27:17,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:17,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:27:17,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:27:17,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:27:17,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:17,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:18,221 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:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:27:18,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482438021] [2025-04-14 00:27:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482438021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:27:18,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463272468] [2025-04-14 00:27:18,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:27:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:27:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:27:18,223 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:27:18,225 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:27:18,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:27:18,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:27:18,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:27:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:27:18,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:27:18,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:28:19,250 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:19,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:28:28,187 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:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463272468] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:28:28,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:28:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:28:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382525449] [2025-04-14 00:28:28,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:28:28,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:28:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:28:28,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:28:28,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=167, Unknown=7, NotChecked=0, Total=240 [2025-04-14 00:28:28,188 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:28:28,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 260 transitions, 2848 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:28:28,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:28:28,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:28:28,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:28:42,595 WARN L286 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 49 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:28:47,115 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:51,142 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:07,047 WARN L286 SmtUtils]: Spent 11.47s on a formula simplification. DAG size of input: 49 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:29:12,050 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:14,560 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:17,003 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:19,345 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:24,593 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:32,350 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:29:34,065 INFO L116 PetriNetUnfolderBase]: 5311/7333 cut-off events. [2025-04-14 00:29:34,065 INFO L117 PetriNetUnfolderBase]: For 49343/49359 co-relation queries the response was YES. [2025-04-14 00:29:34,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46535 conditions, 7333 events. 5311/7333 cut-off events. For 49343/49359 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 37421 event pairs, 430 based on Foata normal form. 14/7335 useless extension candidates. Maximal degree in co-relation 45988. Up to 5915 conditions per place. [2025-04-14 00:29:34,114 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 366 selfloop transitions, 96 changer transitions 18/484 dead transitions. [2025-04-14 00:29:34,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 484 transitions, 5794 flow [2025-04-14 00:29:34,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:29:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:29:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 317 transitions. [2025-04-14 00:29:34,116 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6391129032258065 [2025-04-14 00:29:34,116 INFO L175 Difference]: Start difference. First operand has 119 places, 260 transitions, 2848 flow. Second operand 16 states and 317 transitions. [2025-04-14 00:29:34,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 484 transitions, 5794 flow [2025-04-14 00:29:34,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 484 transitions, 5453 flow, removed 168 selfloop flow, removed 1 redundant places. [2025-04-14 00:29:34,228 INFO L231 Difference]: Finished difference. Result has 143 places, 345 transitions, 3944 flow [2025-04-14 00:29:34,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2511, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3944, PETRI_PLACES=143, PETRI_TRANSITIONS=345} [2025-04-14 00:29:34,229 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 108 predicate places. [2025-04-14 00:29:34,229 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 345 transitions, 3944 flow [2025-04-14 00:29:34,229 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:29:34,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:29:34,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:29:34,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 00:29:34,429 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:29:34,430 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:29:34,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:29:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash -727158143, now seen corresponding path program 2 times [2025-04-14 00:29:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:29:34,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614531539] [2025-04-14 00:29:34,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:29:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:29:34,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:29:34,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:29:34,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:29:34,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:34,757 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:29:34,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:29:34,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614531539] [2025-04-14 00:29:34,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614531539] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:29:34,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912222424] [2025-04-14 00:29:34,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:29:34,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:29:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:29:34,759 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:29:34,760 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:29:34,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:29:34,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:29:34,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:29:34,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:29:34,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:29:34,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:30:49,108 WARN L286 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:31:37,642 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:37,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:32:14,565 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:32:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912222424] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:32:14,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:32:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-14 00:32:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231572387] [2025-04-14 00:32:14,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:32:14,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:32:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:32:14,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:32:14,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=167, Unknown=20, NotChecked=0, Total=240 [2025-04-14 00:32:14,566 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:32:14,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 345 transitions, 3944 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:32:14,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:32:14,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:32:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:32:18,978 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:32,344 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 32 DAG size of output: 31 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:32:43,777 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:47,344 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:32:59,415 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:04,409 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:08,411 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:12,426 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:33:24,525 WARN L286 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:33:33,644 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,822 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:38,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:44,211 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:47,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:33:51,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:33:56,079 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,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:02,715 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:04,776 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:34:08,950 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:12,976 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:14,706 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:34:19,201 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:21,090 INFO L116 PetriNetUnfolderBase]: 8124/11381 cut-off events. [2025-04-14 00:34:21,091 INFO L117 PetriNetUnfolderBase]: For 112171/112175 co-relation queries the response was YES. [2025-04-14 00:34:21,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76801 conditions, 11381 events. 8124/11381 cut-off events. For 112171/112175 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 63696 event pairs, 198 based on Foata normal form. 17/11395 useless extension candidates. Maximal degree in co-relation 75869. Up to 6050 conditions per place. [2025-04-14 00:34:21,171 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 517 selfloop transitions, 238 changer transitions 21/780 dead transitions. [2025-04-14 00:34:21,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 780 transitions, 9786 flow [2025-04-14 00:34:21,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:34:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:34:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 409 transitions. [2025-04-14 00:34:21,172 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7329749103942652 [2025-04-14 00:34:21,172 INFO L175 Difference]: Start difference. First operand has 143 places, 345 transitions, 3944 flow. Second operand 18 states and 409 transitions. [2025-04-14 00:34:21,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 780 transitions, 9786 flow [2025-04-14 00:34:21,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 780 transitions, 9129 flow, removed 325 selfloop flow, removed 1 redundant places. [2025-04-14 00:34:21,467 INFO L231 Difference]: Finished difference. Result has 167 places, 526 transitions, 6622 flow [2025-04-14 00:34:21,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3485, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6622, PETRI_PLACES=167, PETRI_TRANSITIONS=526} [2025-04-14 00:34:21,468 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 132 predicate places. [2025-04-14 00:34:21,468 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 526 transitions, 6622 flow [2025-04-14 00:34:21,468 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:34:21,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:21,469 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:34:21,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 00:34:21,669 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:34:21,669 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:34:21,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash -613963734, now seen corresponding path program 3 times [2025-04-14 00:34:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:21,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220834464] [2025-04-14 00:34:21,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:21,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:34:21,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:34:21,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:21,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:21,768 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:34:21,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:21,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220834464] [2025-04-14 00:34:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220834464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:21,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232914396] [2025-04-14 00:34:21,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:21,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:21,771 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:34:21,773 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:34:21,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:34:21,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:34:21,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:21,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:21,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:34:21,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:22,421 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:34:22,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:22,869 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:34:22,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232914396] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:22,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:22,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-14 00:34:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960890207] [2025-04-14 00:34:22,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:22,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:34:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:22,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:34:22,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:34:22,870 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:34:22,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 526 transitions, 6622 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:34:22,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:22,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:34:22,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:26,278 INFO L116 PetriNetUnfolderBase]: 10127/14227 cut-off events. [2025-04-14 00:34:26,279 INFO L117 PetriNetUnfolderBase]: For 193365/193373 co-relation queries the response was YES. [2025-04-14 00:34:26,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104146 conditions, 14227 events. 10127/14227 cut-off events. For 193365/193373 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 80754 event pairs, 333 based on Foata normal form. 185/14404 useless extension candidates. Maximal degree in co-relation 103261. Up to 3864 conditions per place. [2025-04-14 00:34:26,399 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 740 selfloop transitions, 201 changer transitions 31/976 dead transitions. [2025-04-14 00:34:26,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 976 transitions, 14156 flow [2025-04-14 00:34:26,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:34:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:34:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 252 transitions. [2025-04-14 00:34:26,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-04-14 00:34:26,401 INFO L175 Difference]: Start difference. First operand has 167 places, 526 transitions, 6622 flow. Second operand 12 states and 252 transitions. [2025-04-14 00:34:26,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 976 transitions, 14156 flow [2025-04-14 00:34:26,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 976 transitions, 13143 flow, removed 497 selfloop flow, removed 2 redundant places. [2025-04-14 00:34:26,953 INFO L231 Difference]: Finished difference. Result has 182 places, 588 transitions, 7740 flow [2025-04-14 00:34:26,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6143, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7740, PETRI_PLACES=182, PETRI_TRANSITIONS=588} [2025-04-14 00:34:26,954 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 147 predicate places. [2025-04-14 00:34:26,954 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 588 transitions, 7740 flow [2025-04-14 00:34:26,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has 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:34:26,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:26,955 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:34:26,960 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:34:27,159 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:34:27,159 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:34:27,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -794568768, now seen corresponding path program 3 times [2025-04-14 00:34:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:27,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630852709] [2025-04-14 00:34:27,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:27,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:27,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:34:27,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:34:27,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:27,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:34:27,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:27,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630852709] [2025-04-14 00:34:27,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630852709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:27,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489231342] [2025-04-14 00:34:27,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:27,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:27,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:27,288 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:34:27,289 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:34:27,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 00:34:27,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:34:27,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:27,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:27,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:34:27,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:34:59,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:35:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489231342] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:02,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-14 00:35:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282200516] [2025-04-14 00:35:02,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:02,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:35:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:02,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:35:02,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2025-04-14 00:35:02,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-14 00:35:02,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 588 transitions, 7740 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:35:02,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:02,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-14 00:35:02,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:09,796 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:18,684 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:22,952 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:35:28,668 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:31,871 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:33,568 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:37,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:35:41,614 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:43,908 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:35:48,265 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:52,283 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:57,822 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:03,902 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:08,259 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:12,270 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:16,282 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:20,619 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:23,507 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:36:27,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 [] Received shutdown request... [2025-04-14 00:36:31,188 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:36:31,189 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:36:31,728 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:31,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:36:31,817 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 00:36:31,826 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:36:32,018 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:36:32,018 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 8/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 120493 conditions, 15173 events (11260/15172 cut-off events. For 253838/253842 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 88233 event pairs, 380 based on Foata normal form. 232/16302 useless extension candidates. Maximal degree in co-relation 120081. Up to 4560 conditions per place.). [2025-04-14 00:36:32,020 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-14 00:36:32,020 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 00:36:32,020 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-14 00:36:32,020 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-14 00:36:32,029 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1] [2025-04-14 00:36:32,040 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:36:32,040 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:36:32,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:36:32 BasicIcfg [2025-04-14 00:36:32,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:36:32,054 INFO L158 Benchmark]: Toolchain (without parser) took 877108.56ms. Allocated memory was 125.8MB in the beginning and 675.3MB in the end (delta: 549.5MB). Free memory was 86.5MB in the beginning and 299.2MB in the end (delta: -212.7MB). Peak memory consumption was 641.5MB. Max. memory is 8.0GB. [2025-04-14 00:36:32,054 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:36:32,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.46ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 72.0MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-14 00:36:32,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.99ms. Allocated memory is still 125.8MB. Free memory was 72.0MB in the beginning and 70.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:36:32,055 INFO L158 Benchmark]: Boogie Preprocessor took 30.71ms. Allocated memory is still 125.8MB. Free memory was 70.2MB in the beginning and 68.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:36:32,055 INFO L158 Benchmark]: IcfgBuilder took 386.35ms. Allocated memory is still 125.8MB. Free memory was 68.6MB in the beginning and 38.4MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:36:32,055 INFO L158 Benchmark]: TraceAbstraction took 876469.84ms. Allocated memory was 125.8MB in the beginning and 675.3MB in the end (delta: 549.5MB). Free memory was 37.6MB in the beginning and 299.2MB in the end (delta: -261.6MB). Peak memory consumption was 599.6MB. Max. memory is 8.0GB. [2025-04-14 00:36:32,060 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.24ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.46ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 72.0MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.99ms. Allocated memory is still 125.8MB. Free memory was 72.0MB in the beginning and 70.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.71ms. Allocated memory is still 125.8MB. Free memory was 70.2MB in the beginning and 68.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 386.35ms. Allocated memory is still 125.8MB. Free memory was 68.6MB in the beginning and 38.4MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 876469.84ms. Allocated memory was 125.8MB in the beginning and 675.3MB in the end (delta: 549.5MB). Free memory was 37.6MB in the beginning and 299.2MB in the end (delta: -261.6MB). Peak memory consumption was 599.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 8/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 120493 conditions, 15173 events (11260/15172 cut-off events. For 253838/253842 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 88233 event pairs, 380 based on Foata normal form. 232/16302 useless extension candidates. Maximal degree in co-relation 120081. Up to 4560 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 8/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 120493 conditions, 15173 events (11260/15172 cut-off events. For 253838/253842 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 88233 event pairs, 380 based on Foata normal form. 232/16302 useless extension candidates. Maximal degree in co-relation 120081. Up to 4560 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 8/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 120493 conditions, 15173 events (11260/15172 cut-off events. For 253838/253842 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 88233 event pairs, 380 based on Foata normal form. 232/16302 useless extension candidates. Maximal degree in co-relation 120081. Up to 4560 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 8/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 120493 conditions, 15173 events (11260/15172 cut-off events. For 253838/253842 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 88233 event pairs, 380 based on Foata normal form. 232/16302 useless extension candidates. Maximal degree in co-relation 120081. Up to 4560 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 8/31 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 120493 conditions, 15173 events (11260/15172 cut-off events. For 253838/253842 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 88233 event pairs, 380 based on Foata normal form. 232/16302 useless extension candidates. Maximal degree in co-relation 120081. Up to 4560 conditions per place.). - 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: 876.4s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 459.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 55 mSolverCounterUnknown, 1303 SdHoareTripleChecker+Valid, 316.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1303 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 315.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5347 IncrementalHoareTripleChecker+Invalid, 5557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 0 mSDtfsCounter, 5347 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 394 SyntacticMatches, 10 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 397.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7740occurred in iteration=14, InterpolantAutomatonStates: 122, 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, 413.7s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 14057 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1574 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 13/61 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