/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:45:42,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:45:42,698 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-13 19:45:42,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:45:42,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:45:42,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:45:42,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:45:42,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:45:42,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:45:42,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:45:42,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:45:42,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:45:42,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:45:42,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:45:42,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:45:42,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:42,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:42,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:45:42,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:45:42,724 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 [2025-04-13 19:45:42,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:45:42,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:45:42,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:45:42,962 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:45:42,964 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:45:42,965 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-13 19:45:44,309 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598d4439e/05c52d31620d4eddbf1537743d76f8c9/FLAGb4dc2a118 [2025-04-13 19:45:44,523 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:45:44,523 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2025-04-13 19:45:44,532 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598d4439e/05c52d31620d4eddbf1537743d76f8c9/FLAGb4dc2a118 [2025-04-13 19:45:45,309 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598d4439e/05c52d31620d4eddbf1537743d76f8c9 [2025-04-13 19:45:45,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:45:45,312 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:45:45,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:45:45,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:45:45,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:45:45,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206a773b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45, skipping insertion in model container [2025-04-13 19:45:45,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:45:45,479 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-13 19:45:45,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:45:45,494 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:45:45,515 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-13 19:45:45,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:45:45,524 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:45:45,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45 WrapperNode [2025-04-13 19:45:45,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:45:45,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:45:45,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:45:45,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:45:45,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,549 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-13 19:45:45,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:45:45,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:45:45,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:45:45,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:45:45,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,572 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-13 19:45:45,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:45:45,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:45:45,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:45:45,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:45:45,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (1/1) ... [2025-04-13 19:45:45,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:45,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:45,612 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-13 19:45:45,614 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-13 19:45:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:45:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:45:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:45:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:45:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:45:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:45:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:45:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 19:45:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 19:45:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:45:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:45:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:45:45,632 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:45:45,696 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:45:45,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:45:45,833 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:45:45,833 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:45:45,834 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:45:45,951 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:45:45,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:45:45 BoogieIcfgContainer [2025-04-13 19:45:45,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:45:45,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:45:45,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:45:45,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:45:45,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:45:45" (1/3) ... [2025-04-13 19:45:45,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6147c51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:45:45, skipping insertion in model container [2025-04-13 19:45:45,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:45" (2/3) ... [2025-04-13 19:45:45,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6147c51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:45:45, skipping insertion in model container [2025-04-13 19:45:45,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:45:45" (3/3) ... [2025-04-13 19:45:45,960 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2025-04-13 19:45:45,969 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:45:45,970 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-13 19:45:45,970 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:45:46,010 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 19:45:46,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:45:46,056 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-13 19:45:46,059 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:45:46,061 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 21 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-13 19:45:46,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:45:46,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-13 19:45:46,071 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:45:46,079 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;@3d267fcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:45:46,079 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:45:46,090 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:45:46,090 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-13 19:45:46,090 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:45:46,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:46,091 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-13 19:45:46,091 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-13 19:45:46,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2083288633, now seen corresponding path program 1 times [2025-04-13 19:45:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:46,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220226130] [2025-04-13 19:45:46,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:46,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:45:46,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:45:46,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:46,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:46,519 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-13 19:45:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:46,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220226130] [2025-04-13 19:45:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220226130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:46,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:45:46,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875777402] [2025-04-13 19:45:46,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:46,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:45:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:46,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:45:46,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:45:46,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:46,546 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-13 19:45:46,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:46,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:46,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:46,766 INFO L116 PetriNetUnfolderBase]: 1367/1731 cut-off events. [2025-04-13 19:45:46,767 INFO L117 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-04-13 19:45:46,773 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 5584 event pairs, 123 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-04-13 19:45:46,809 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2025-04-13 19:45:46,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 217 flow [2025-04-13 19:45:46,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:45:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:45:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-13 19:45:46,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-13 19:45:46,821 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 76 flow. Second operand 3 states and 66 transitions. [2025-04-13 19:45:46,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 217 flow [2025-04-13 19:45:46,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 19:45:46,828 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 93 flow [2025-04-13 19:45:46,830 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-13 19:45:46,832 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-13 19:45:46,833 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 93 flow [2025-04-13 19:45:46,833 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-13 19:45:46,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:46,833 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-13 19:45:46,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:45:46,833 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-13 19:45:46,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2017761847, now seen corresponding path program 1 times [2025-04-13 19:45:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:46,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162262250] [2025-04-13 19:45:46,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:46,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:45:46,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:46,946 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-13 19:45:46,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:46,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162262250] [2025-04-13 19:45:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162262250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:46,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:46,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256773762] [2025-04-13 19:45:46,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:46,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:46,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:46,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:46,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:46,948 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:46,948 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-13 19:45:46,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:46,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:46,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:47,179 INFO L116 PetriNetUnfolderBase]: 1593/2036 cut-off events. [2025-04-13 19:45:47,179 INFO L117 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2025-04-13 19:45:47,181 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 6999 event pairs, 113 based on Foata normal form. 34/2064 useless extension candidates. Maximal degree in co-relation 1272. Up to 842 conditions per place. [2025-04-13 19:45:47,190 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 66 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-04-13 19:45:47,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 80 transitions, 389 flow [2025-04-13 19:45:47,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-13 19:45:47,193 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-13 19:45:47,193 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 93 flow. Second operand 5 states and 110 transitions. [2025-04-13 19:45:47,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 80 transitions, 389 flow [2025-04-13 19:45:47,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 80 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:47,195 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 153 flow [2025-04-13 19:45:47,195 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-13 19:45:47,195 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-13 19:45:47,195 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 153 flow [2025-04-13 19:45:47,196 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-13 19:45:47,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:47,196 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-13 19:45:47,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:45:47,196 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-13 19:45:47,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1887188821, now seen corresponding path program 1 times [2025-04-13 19:45:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:47,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577324371] [2025-04-13 19:45:47,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:47,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:45:47,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:47,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:47,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:47,297 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-13 19:45:47,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:47,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577324371] [2025-04-13 19:45:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577324371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:47,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747480557] [2025-04-13 19:45:47,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:47,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:47,300 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-13 19:45:47,301 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-13 19:45:47,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:45:47,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:47,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:47,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:47,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:45:47,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:47,495 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-13 19:45:47,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:47,553 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-13 19:45:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747480557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:47,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:45:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191365988] [2025-04-13 19:45:47,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:47,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:45:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:47,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:45:47,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:45:47,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:47,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 12.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-13 19:45:47,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:47,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:47,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:47,793 INFO L116 PetriNetUnfolderBase]: 1921/2544 cut-off events. [2025-04-13 19:45:47,793 INFO L117 PetriNetUnfolderBase]: For 3334/3334 co-relation queries the response was YES. [2025-04-13 19:45:47,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7915 conditions, 2544 events. 1921/2544 cut-off events. For 3334/3334 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10094 event pairs, 288 based on Foata normal form. 64/2584 useless extension candidates. Maximal degree in co-relation 3123. Up to 1063 conditions per place. [2025-04-13 19:45:47,808 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 79 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-04-13 19:45:47,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 91 transitions, 569 flow [2025-04-13 19:45:47,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-13 19:45:47,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-13 19:45:47,810 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 153 flow. Second operand 5 states and 103 transitions. [2025-04-13 19:45:47,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 91 transitions, 569 flow [2025-04-13 19:45:47,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 91 transitions, 569 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:45:47,815 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 208 flow [2025-04-13 19:45:47,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-13 19:45:47,816 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-04-13 19:45:47,816 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 208 flow [2025-04-13 19:45:47,816 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-13 19:45:47,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:47,817 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-13 19:45:47,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:45:48,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:48,021 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-13 19:45:48,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1935935673, now seen corresponding path program 2 times [2025-04-13 19:45:48,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:48,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569858575] [2025-04-13 19:45:48,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:48,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:48,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:45:48,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:48,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:48,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:48,120 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-13 19:45:48,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:48,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569858575] [2025-04-13 19:45:48,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569858575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:48,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471621205] [2025-04-13 19:45:48,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:48,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:48,123 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-13 19:45:48,124 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-13 19:45:48,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:45:48,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:48,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:48,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:48,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:45:48,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:48,257 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-13 19:45:48,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:48,301 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-13 19:45:48,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471621205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:48,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:48,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:45:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922419048] [2025-04-13 19:45:48,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:48,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:45:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:48,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:45:48,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:45:48,302 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:48,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 208 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-13 19:45:48,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:48,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:48,558 INFO L116 PetriNetUnfolderBase]: 1835/2440 cut-off events. [2025-04-13 19:45:48,558 INFO L117 PetriNetUnfolderBase]: For 4078/4078 co-relation queries the response was YES. [2025-04-13 19:45:48,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9082 conditions, 2440 events. 1835/2440 cut-off events. For 4078/4078 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9951 event pairs, 348 based on Foata normal form. 90/2520 useless extension candidates. Maximal degree in co-relation 4692. Up to 1412 conditions per place. [2025-04-13 19:45:48,576 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 83 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2025-04-13 19:45:48,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 97 transitions, 647 flow [2025-04-13 19:45:48,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 19:45:48,578 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-13 19:45:48,578 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 208 flow. Second operand 5 states and 109 transitions. [2025-04-13 19:45:48,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 97 transitions, 647 flow [2025-04-13 19:45:48,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 97 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:45:48,590 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 262 flow [2025-04-13 19:45:48,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-04-13 19:45:48,591 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2025-04-13 19:45:48,591 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 262 flow [2025-04-13 19:45:48,593 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-13 19:45:48,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:48,593 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-13 19:45:48,598 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-13 19:45:48,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 19:45:48,797 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-13 19:45:48,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash -44947852, now seen corresponding path program 1 times [2025-04-13 19:45:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:48,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734895615] [2025-04-13 19:45:48,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:48,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:45:48,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:48,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:48,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:48,875 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-13 19:45:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:48,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734895615] [2025-04-13 19:45:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734895615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837332399] [2025-04-13 19:45:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:48,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:48,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:48,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:48,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:48,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 262 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-13 19:45:48,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:48,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:48,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:49,121 INFO L116 PetriNetUnfolderBase]: 1783/2375 cut-off events. [2025-04-13 19:45:49,121 INFO L117 PetriNetUnfolderBase]: For 6417/6417 co-relation queries the response was YES. [2025-04-13 19:45:49,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9791 conditions, 2375 events. 1783/2375 cut-off events. For 6417/6417 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9682 event pairs, 131 based on Foata normal form. 52/2423 useless extension candidates. Maximal degree in co-relation 5285. Up to 1057 conditions per place. [2025-04-13 19:45:49,143 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 84 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2025-04-13 19:45:49,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 671 flow [2025-04-13 19:45:49,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-13 19:45:49,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6967741935483871 [2025-04-13 19:45:49,145 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 262 flow. Second operand 5 states and 108 transitions. [2025-04-13 19:45:49,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 96 transitions, 671 flow [2025-04-13 19:45:49,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 96 transitions, 662 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:49,154 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 267 flow [2025-04-13 19:45:49,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-04-13 19:45:49,156 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-13 19:45:49,156 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 267 flow [2025-04-13 19:45:49,156 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-13 19:45:49,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:49,156 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-13 19:45:49,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:45:49,156 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-13 19:45:49,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1206198602, now seen corresponding path program 1 times [2025-04-13 19:45:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:49,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981886678] [2025-04-13 19:45:49,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:49,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:45:49,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:49,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:49,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:49,239 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-13 19:45:49,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:49,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981886678] [2025-04-13 19:45:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981886678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423044399] [2025-04-13 19:45:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:49,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:49,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:49,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:49,241 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:49,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 267 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-13 19:45:49,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:49,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:49,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:49,466 INFO L116 PetriNetUnfolderBase]: 1750/2360 cut-off events. [2025-04-13 19:45:49,466 INFO L117 PetriNetUnfolderBase]: For 7801/7801 co-relation queries the response was YES. [2025-04-13 19:45:49,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10006 conditions, 2360 events. 1750/2360 cut-off events. For 7801/7801 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9336 event pairs, 71 based on Foata normal form. 33/2371 useless extension candidates. Maximal degree in co-relation 5373. Up to 983 conditions per place. [2025-04-13 19:45:49,480 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 93 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2025-04-13 19:45:49,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 107 transitions, 891 flow [2025-04-13 19:45:49,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-13 19:45:49,482 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-13 19:45:49,482 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 267 flow. Second operand 5 states and 101 transitions. [2025-04-13 19:45:49,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 107 transitions, 891 flow [2025-04-13 19:45:49,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 107 transitions, 866 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:49,488 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 321 flow [2025-04-13 19:45:49,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=258, 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=321, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-04-13 19:45:49,489 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-13 19:45:49,489 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 321 flow [2025-04-13 19:45:49,489 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-13 19:45:49,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:49,489 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-13 19:45:49,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:45:49,489 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-13 19:45:49,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1519960578, now seen corresponding path program 2 times [2025-04-13 19:45:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:49,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554868083] [2025-04-13 19:45:49,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:49,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:45:49,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:49,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:49,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:49,560 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-13 19:45:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:49,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554868083] [2025-04-13 19:45:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554868083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:49,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703565903] [2025-04-13 19:45:49,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:49,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:49,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:49,564 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-13 19:45:49,564 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-13 19:45:49,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:45:49,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:49,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:49,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:49,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:45:49,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:49,749 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-13 19:45:49,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:49,802 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-13 19:45:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703565903] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:49,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:45:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387630965] [2025-04-13 19:45:49,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:49,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:45:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:49,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:45:49,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:45:49,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:49,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 321 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-13 19:45:49,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:49,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:49,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:50,028 INFO L116 PetriNetUnfolderBase]: 1688/2310 cut-off events. [2025-04-13 19:45:50,028 INFO L117 PetriNetUnfolderBase]: For 7651/7651 co-relation queries the response was YES. [2025-04-13 19:45:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10378 conditions, 2310 events. 1688/2310 cut-off events. For 7651/7651 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9587 event pairs, 258 based on Foata normal form. 62/2350 useless extension candidates. Maximal degree in co-relation 6519. Up to 1365 conditions per place. [2025-04-13 19:45:50,040 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-04-13 19:45:50,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 897 flow [2025-04-13 19:45:50,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-13 19:45:50,041 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.632258064516129 [2025-04-13 19:45:50,041 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 321 flow. Second operand 5 states and 98 transitions. [2025-04-13 19:45:50,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 897 flow [2025-04-13 19:45:50,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 882 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:50,047 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 360 flow [2025-04-13 19:45:50,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=306, 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=360, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-04-13 19:45:50,047 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-04-13 19:45:50,047 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 360 flow [2025-04-13 19:45:50,047 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-13 19:45:50,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:50,047 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-13 19:45:50,053 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-13 19:45:50,252 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-13 19:45:50,252 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-13 19:45:50,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash -459306797, now seen corresponding path program 2 times [2025-04-13 19:45:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:50,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149082967] [2025-04-13 19:45:50,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:50,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:50,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:45:50,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:50,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:50,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:50,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:50,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149082967] [2025-04-13 19:45:50,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149082967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760393155] [2025-04-13 19:45:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:50,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:50,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:50,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:50,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:50,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 360 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-13 19:45:50,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:50,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:50,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:50,486 INFO L116 PetriNetUnfolderBase]: 1515/2057 cut-off events. [2025-04-13 19:45:50,487 INFO L117 PetriNetUnfolderBase]: For 7393/7393 co-relation queries the response was YES. [2025-04-13 19:45:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9772 conditions, 2057 events. 1515/2057 cut-off events. For 7393/7393 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7969 event pairs, 75 based on Foata normal form. 31/2066 useless extension candidates. Maximal degree in co-relation 8473. Up to 864 conditions per place. [2025-04-13 19:45:50,500 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 9 changer transitions 4/108 dead transitions. [2025-04-13 19:45:50,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 924 flow [2025-04-13 19:45:50,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-13 19:45:50,501 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-13 19:45:50,501 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 360 flow. Second operand 5 states and 101 transitions. [2025-04-13 19:45:50,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 924 flow [2025-04-13 19:45:50,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 904 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 19:45:50,512 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 355 flow [2025-04-13 19:45:50,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=318, 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=355, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-04-13 19:45:50,513 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-04-13 19:45:50,513 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 355 flow [2025-04-13 19:45:50,513 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-13 19:45:50,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:50,513 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-13 19:45:50,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:45:50,513 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-13 19:45:50,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 656567610, now seen corresponding path program 2 times [2025-04-13 19:45:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:50,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107475974] [2025-04-13 19:45:50,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:50,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:45:50,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:50,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:50,577 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-13 19:45:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:50,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107475974] [2025-04-13 19:45:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107475974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:50,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181603902] [2025-04-13 19:45:50,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:50,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:50,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:50,579 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-13 19:45:50,582 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-13 19:45:50,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:45:50,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:50,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:50,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:50,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:45:50,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:50,700 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-13 19:45:50,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:50,737 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-13 19:45:50,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181603902] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:50,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:45:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469347211] [2025-04-13 19:45:50,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:50,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:45:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:50,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:45:50,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:45:50,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:50,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 355 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-13 19:45:50,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:50,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:50,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:50,959 INFO L116 PetriNetUnfolderBase]: 1447/1984 cut-off events. [2025-04-13 19:45:50,960 INFO L117 PetriNetUnfolderBase]: For 7210/7210 co-relation queries the response was YES. [2025-04-13 19:45:50,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9606 conditions, 1984 events. 1447/1984 cut-off events. For 7210/7210 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8159 event pairs, 375 based on Foata normal form. 68/2042 useless extension candidates. Maximal degree in co-relation 8261. Up to 1150 conditions per place. [2025-04-13 19:45:50,969 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 111 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-04-13 19:45:50,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 123 transitions, 1075 flow [2025-04-13 19:45:50,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-13 19:45:50,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6838709677419355 [2025-04-13 19:45:50,973 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 355 flow. Second operand 5 states and 106 transitions. [2025-04-13 19:45:50,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 123 transitions, 1075 flow [2025-04-13 19:45:50,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 1042 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:50,983 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 401 flow [2025-04-13 19:45:50,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=344, 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=401, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-04-13 19:45:50,984 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2025-04-13 19:45:50,984 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 401 flow [2025-04-13 19:45:50,984 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-13 19:45:50,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:50,984 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-13 19:45:50,993 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-13 19:45:51,187 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-13 19:45:51,187 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-13 19:45:51,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash -742515214, now seen corresponding path program 1 times [2025-04-13 19:45:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:51,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064974508] [2025-04-13 19:45:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:51,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:45:51,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:45:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:51,551 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-13 19:45:51,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:51,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064974508] [2025-04-13 19:45:51,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064974508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:51,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957232889] [2025-04-13 19:45:51,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:51,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:51,553 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-13 19:45:51,555 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-13 19:45:51,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:45:51,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:45:51,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:51,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:51,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:45:51,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:53,333 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-13 19:45:53,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:53,963 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-13 19:45:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957232889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:53,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 19:45:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456809578] [2025-04-13 19:45:53,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:53,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:45:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:53,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:45:53,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:45:53,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:45:53,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 401 flow. Second operand has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 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-13 19:45:53,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:53,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:45:53,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:56,197 INFO L116 PetriNetUnfolderBase]: 2703/3707 cut-off events. [2025-04-13 19:45:56,197 INFO L117 PetriNetUnfolderBase]: For 13742/13742 co-relation queries the response was YES. [2025-04-13 19:45:56,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18559 conditions, 3707 events. 2703/3707 cut-off events. For 13742/13742 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16510 event pairs, 282 based on Foata normal form. 15/3712 useless extension candidates. Maximal degree in co-relation 16438. Up to 2092 conditions per place. [2025-04-13 19:45:56,224 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 179 selfloop transitions, 100 changer transitions 20/303 dead transitions. [2025-04-13 19:45:56,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 303 transitions, 2740 flow [2025-04-13 19:45:56,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:45:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:45:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 329 transitions. [2025-04-13 19:45:56,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6633064516129032 [2025-04-13 19:45:56,226 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 401 flow. Second operand 16 states and 329 transitions. [2025-04-13 19:45:56,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 303 transitions, 2740 flow [2025-04-13 19:45:56,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 303 transitions, 2651 flow, removed 32 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:56,246 INFO L231 Difference]: Finished difference. Result has 93 places, 152 transitions, 1639 flow [2025-04-13 19:45:56,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1639, PETRI_PLACES=93, PETRI_TRANSITIONS=152} [2025-04-13 19:45:56,247 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-04-13 19:45:56,247 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 152 transitions, 1639 flow [2025-04-13 19:45:56,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 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-13 19:45:56,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:56,248 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-13 19:45:56,254 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-13 19:45:56,452 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-13 19:45:56,452 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-13 19:45:56,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash 84304514, now seen corresponding path program 2 times [2025-04-13 19:45:56,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:56,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665336124] [2025-04-13 19:45:56,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:56,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:45:56,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:45:56,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:56,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:56,737 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-13 19:45:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:56,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665336124] [2025-04-13 19:45:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665336124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:56,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743259368] [2025-04-13 19:45:56,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:56,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:56,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:56,741 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-13 19:45:56,742 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-13 19:45:56,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:45:56,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:45:56,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:56,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 19:45:56,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:46:12,241 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-13 19:46:12,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:46:13,054 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-13 19:46:13,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743259368] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:46:13,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:46:13,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-13 19:46:13,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248302129] [2025-04-13 19:46:13,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:46:13,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:46:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:46:13,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:46:13,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:46:13,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:46:13,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 152 transitions, 1639 flow. Second operand has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 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-13 19:46:13,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:46:13,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:46:13,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:46:14,939 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:46:21,112 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:46:33,158 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:46:37,160 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-13 19:46:39,281 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:46:44,031 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-13 19:46:46,187 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:46:50,099 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:46:53,145 INFO L116 PetriNetUnfolderBase]: 3706/5081 cut-off events. [2025-04-13 19:46:53,146 INFO L117 PetriNetUnfolderBase]: For 28064/28064 co-relation queries the response was YES. [2025-04-13 19:46:53,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29929 conditions, 5081 events. 3706/5081 cut-off events. For 28064/28064 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 23708 event pairs, 366 based on Foata normal form. 3/5074 useless extension candidates. Maximal degree in co-relation 29472. Up to 3705 conditions per place. [2025-04-13 19:46:53,177 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 257 selfloop transitions, 92 changer transitions 5/358 dead transitions. [2025-04-13 19:46:53,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 358 transitions, 4067 flow [2025-04-13 19:46:53,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 19:46:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 19:46:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 275 transitions. [2025-04-13 19:46:53,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6336405529953917 [2025-04-13 19:46:53,178 INFO L175 Difference]: Start difference. First operand has 93 places, 152 transitions, 1639 flow. Second operand 14 states and 275 transitions. [2025-04-13 19:46:53,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 358 transitions, 4067 flow [2025-04-13 19:46:53,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 358 transitions, 3866 flow, removed 98 selfloop flow, removed 1 redundant places. [2025-04-13 19:46:53,240 INFO L231 Difference]: Finished difference. Result has 112 places, 241 transitions, 2777 flow [2025-04-13 19:46:53,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2777, PETRI_PLACES=112, PETRI_TRANSITIONS=241} [2025-04-13 19:46:53,241 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2025-04-13 19:46:53,241 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 241 transitions, 2777 flow [2025-04-13 19:46:53,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 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-13 19:46:53,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:46:53,241 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-13 19:46:53,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 19:46:53,445 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-13 19:46:53,445 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-13 19:46:53,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:46:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1787283770, now seen corresponding path program 1 times [2025-04-13 19:46:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:46:53,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517542891] [2025-04-13 19:46:53,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:46:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:46:53,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:46:53,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:46:53,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:46:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:46:53,764 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-13 19:46:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:46:53,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517542891] [2025-04-13 19:46:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517542891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:46:53,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014876249] [2025-04-13 19:46:53,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:46:53,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:46:53,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:46:53,766 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-13 19:46:53,767 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-13 19:46:53,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:46:53,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:46:53,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:46:53,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:46:53,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:46:53,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:48:17,404 WARN L286 SmtUtils]: Spent 11.88s 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-13 19:48:50,769 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-13 19:48:50,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:49:01,956 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-13 19:49:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014876249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:49:01,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:49:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 19:49:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784794131] [2025-04-13 19:49:01,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:49:01,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:49:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:01,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:49:01,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=168, Unknown=11, NotChecked=0, Total=240 [2025-04-13 19:49:01,957 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:49:01,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 241 transitions, 2777 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-13 19:49:01,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:01,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:49:01,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:35,291 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-13 19:49:39,932 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-13 19:49:43,066 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:49:47,271 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-13 19:49:50,804 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:49:54,873 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:03,649 WARN L286 SmtUtils]: Spent 8.75s 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-13 19:50:13,788 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:19,232 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-13 19:50:23,052 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:25,914 INFO L116 PetriNetUnfolderBase]: 5013/6898 cut-off events. [2025-04-13 19:50:25,915 INFO L117 PetriNetUnfolderBase]: For 45880/45880 co-relation queries the response was YES. [2025-04-13 19:50:25,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42583 conditions, 6898 events. 5013/6898 cut-off events. For 45880/45880 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 34456 event pairs, 343 based on Foata normal form. 21/6909 useless extension candidates. Maximal degree in co-relation 42069. Up to 5276 conditions per place. [2025-04-13 19:50:25,957 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 399 selfloop transitions, 101 changer transitions 15/519 dead transitions. [2025-04-13 19:50:25,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 519 transitions, 5846 flow [2025-04-13 19:50:25,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:50:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:50:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 351 transitions. [2025-04-13 19:50:25,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7076612903225806 [2025-04-13 19:50:25,959 INFO L175 Difference]: Start difference. First operand has 112 places, 241 transitions, 2777 flow. Second operand 16 states and 351 transitions. [2025-04-13 19:50:25,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 519 transitions, 5846 flow [2025-04-13 19:50:26,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 519 transitions, 5439 flow, removed 201 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:26,099 INFO L231 Difference]: Finished difference. Result has 134 places, 341 transitions, 3834 flow [2025-04-13 19:50:26,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2370, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3834, PETRI_PLACES=134, PETRI_TRANSITIONS=341} [2025-04-13 19:50:26,100 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2025-04-13 19:50:26,100 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 341 transitions, 3834 flow [2025-04-13 19:50:26,100 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-13 19:50:26,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:26,100 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-13 19:50:26,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:50:26,300 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-13 19:50:26,301 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-13 19:50:26,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1568165374, now seen corresponding path program 2 times [2025-04-13 19:50:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:26,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93890486] [2025-04-13 19:50:26,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:26,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:50:26,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:26,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:26,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:26,598 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-13 19:50:26,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:26,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93890486] [2025-04-13 19:50:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93890486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:26,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942536202] [2025-04-13 19:50:26,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:26,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:26,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:26,600 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-13 19:50:26,600 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-13 19:50:26,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:50:26,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:26,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:26,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:26,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 19:50:26,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:23,851 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-13 19:51:23,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:40,232 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-13 19:51:40,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942536202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:40,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:40,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-13 19:51:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444781605] [2025-04-13 19:51:40,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:40,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:51:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:40,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:51:40,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=126, Unknown=12, NotChecked=0, Total=182 [2025-04-13 19:51:40,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:51:40,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 341 transitions, 3834 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:51:40,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:40,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:51:40,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:48,578 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:50,515 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:03,084 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-13 19:52:13,057 WARN L286 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 38 DAG size of output: 34 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:52:17,169 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:21,185 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-13 19:52:25,274 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-13 19:52:30,083 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-13 19:52:34,176 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-13 19:52:39,022 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-13 19:52:43,028 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-13 19:52:47,492 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-13 19:52:51,766 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-13 19:52:51,987 INFO L116 PetriNetUnfolderBase]: 6093/8450 cut-off events. [2025-04-13 19:52:51,987 INFO L117 PetriNetUnfolderBase]: For 60365/60365 co-relation queries the response was YES. [2025-04-13 19:52:52,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53564 conditions, 8450 events. 6093/8450 cut-off events. For 60365/60365 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 44395 event pairs, 452 based on Foata normal form. 3/8443 useless extension candidates. Maximal degree in co-relation 52954. Up to 6732 conditions per place. [2025-04-13 19:52:52,033 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 474 selfloop transitions, 42 changer transitions 8/528 dead transitions. [2025-04-13 19:52:52,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 528 transitions, 6319 flow [2025-04-13 19:52:52,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:52:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:52:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2025-04-13 19:52:52,036 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.760752688172043 [2025-04-13 19:52:52,036 INFO L175 Difference]: Start difference. First operand has 134 places, 341 transitions, 3834 flow. Second operand 12 states and 283 transitions. [2025-04-13 19:52:52,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 528 transitions, 6319 flow [2025-04-13 19:52:52,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 528 transitions, 5782 flow, removed 266 selfloop flow, removed 1 redundant places. [2025-04-13 19:52:52,287 INFO L231 Difference]: Finished difference. Result has 149 places, 377 transitions, 3984 flow [2025-04-13 19:52:52,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3984, PETRI_PLACES=149, PETRI_TRANSITIONS=377} [2025-04-13 19:52:52,288 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-04-13 19:52:52,288 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 377 transitions, 3984 flow [2025-04-13 19:52:52,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:52:52,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:52:52,288 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-13 19:52:52,301 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-13 19:52:52,489 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-13 19:52:52,489 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-13 19:52:52,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:52:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash -664833899, now seen corresponding path program 3 times [2025-04-13 19:52:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:52:52,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845914418] [2025-04-13 19:52:52,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:52:52,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:52:52,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:52:52,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:52:52,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:52:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:52,579 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-13 19:52:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:52:52,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845914418] [2025-04-13 19:52:52,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845914418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:52:52,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612266505] [2025-04-13 19:52:52,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:52:52,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:52:52,581 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-13 19:52:52,582 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-13 19:52:52,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:52:52,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:52:52,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:52:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:52,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:52:52,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:52:53,215 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-13 19:52:53,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:52:53,610 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-13 19:52:53,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612266505] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:52:53,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:52:53,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:52:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478270063] [2025-04-13 19:52:53,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:52:53,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:52:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:52:53,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:52:53,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:52:53,611 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:52:53,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 377 transitions, 3984 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-13 19:52:53,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:52:53,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:52:53,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:52:55,962 INFO L116 PetriNetUnfolderBase]: 7727/10712 cut-off events. [2025-04-13 19:52:55,962 INFO L117 PetriNetUnfolderBase]: For 103071/103071 co-relation queries the response was YES. [2025-04-13 19:52:55,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68609 conditions, 10712 events. 7727/10712 cut-off events. For 103071/103071 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 56002 event pairs, 206 based on Foata normal form. 125/10827 useless extension candidates. Maximal degree in co-relation 67876. Up to 2881 conditions per place. [2025-04-13 19:52:56,022 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 610 selfloop transitions, 125 changer transitions 23/762 dead transitions. [2025-04-13 19:52:56,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 762 transitions, 9503 flow [2025-04-13 19:52:56,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:52:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:52:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 252 transitions. [2025-04-13 19:52:56,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-04-13 19:52:56,023 INFO L175 Difference]: Start difference. First operand has 149 places, 377 transitions, 3984 flow. Second operand 12 states and 252 transitions. [2025-04-13 19:52:56,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 762 transitions, 9503 flow [2025-04-13 19:52:56,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 762 transitions, 9076 flow, removed 210 selfloop flow, removed 1 redundant places. [2025-04-13 19:52:56,304 INFO L231 Difference]: Finished difference. Result has 164 places, 416 transitions, 4700 flow [2025-04-13 19:52:56,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3763, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4700, PETRI_PLACES=164, PETRI_TRANSITIONS=416} [2025-04-13 19:52:56,305 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 129 predicate places. [2025-04-13 19:52:56,305 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 416 transitions, 4700 flow [2025-04-13 19:52:56,305 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-13 19:52:56,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:52:56,305 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-13 19:52:56,311 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-13 19:52:56,506 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-13 19:52:56,506 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-13 19:52:56,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:52:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash -4869921, now seen corresponding path program 4 times [2025-04-13 19:52:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:52:56,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046245503] [2025-04-13 19:52:56,507 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:52:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:52:56,514 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:52:56,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:52:56,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:52:56,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:56,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:52:56,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046245503] [2025-04-13 19:52:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046245503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:52:56,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11051610] [2025-04-13 19:52:56,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:52:56,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:56,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:52:56,621 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-13 19:52:56,623 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-13 19:52:56,649 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:52:56,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:52:56,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:52:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:56,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:52:56,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:05,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:17,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11051610] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:53:17,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:53:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:53:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109852096] [2025-04-13 19:53:17,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:53:17,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:53:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:17,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:53:17,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=186, Unknown=5, NotChecked=0, Total=240 [2025-04-13 19:53:17,553 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:53:17,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 416 transitions, 4700 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-13 19:53:17,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:17,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:53:17,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:21,790 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-13 19:53:24,535 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:31,767 INFO L116 PetriNetUnfolderBase]: 8119/11268 cut-off events. [2025-04-13 19:53:31,767 INFO L117 PetriNetUnfolderBase]: For 117646/117646 co-relation queries the response was YES. [2025-04-13 19:53:31,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75993 conditions, 11268 events. 8119/11268 cut-off events. For 117646/117646 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 60161 event pairs, 1009 based on Foata normal form. 120/11378 useless extension candidates. Maximal degree in co-relation 75172. Up to 3842 conditions per place. [2025-04-13 19:53:31,854 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 513 selfloop transitions, 144 changer transitions 5/666 dead transitions. [2025-04-13 19:53:31,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 666 transitions, 8454 flow [2025-04-13 19:53:31,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:53:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:53:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2025-04-13 19:53:31,856 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-04-13 19:53:31,856 INFO L175 Difference]: Start difference. First operand has 164 places, 416 transitions, 4700 flow. Second operand 11 states and 231 transitions. [2025-04-13 19:53:31,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 666 transitions, 8454 flow [2025-04-13 19:53:32,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 666 transitions, 8283 flow, removed 78 selfloop flow, removed 2 redundant places. [2025-04-13 19:53:32,487 INFO L231 Difference]: Finished difference. Result has 176 places, 425 transitions, 5091 flow [2025-04-13 19:53:32,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4500, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5091, PETRI_PLACES=176, PETRI_TRANSITIONS=425} [2025-04-13 19:53:32,488 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 141 predicate places. [2025-04-13 19:53:32,488 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 425 transitions, 5091 flow [2025-04-13 19:53:32,488 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-13 19:53:32,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:32,488 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-13 19:53:32,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 19:53:32,689 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-13 19:53:32,689 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:53:32,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1682777963, now seen corresponding path program 5 times [2025-04-13 19:53:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:32,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713018080] [2025-04-13 19:53:32,690 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:53:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:32,695 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:53:32,705 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:53:32,705 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:32,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:32,871 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-13 19:53:32,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:32,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713018080] [2025-04-13 19:53:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713018080] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:32,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663699010] [2025-04-13 19:53:32,871 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:53:32,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:32,873 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:32,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 19:53:32,902 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:53:33,081 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:53:33,081 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:33,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:33,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:53:33,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:33,659 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-13 19:53:33,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:34,105 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-13 19:53:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663699010] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:53:34,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:53:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:53:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787068619] [2025-04-13 19:53:34,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:53:34,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:53:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:34,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:53:34,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:53:34,106 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:53:34,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 425 transitions, 5091 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-13 19:53:34,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:34,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:53:34,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:39,225 INFO L116 PetriNetUnfolderBase]: 10215/14063 cut-off events. [2025-04-13 19:53:39,225 INFO L117 PetriNetUnfolderBase]: For 202317/202317 co-relation queries the response was YES. [2025-04-13 19:53:39,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103475 conditions, 14063 events. 10215/14063 cut-off events. For 202317/202317 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 75199 event pairs, 248 based on Foata normal form. 196/14249 useless extension candidates. Maximal degree in co-relation 102662. Up to 4344 conditions per place. [2025-04-13 19:53:39,319 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 745 selfloop transitions, 261 changer transitions 44/1054 dead transitions. [2025-04-13 19:53:39,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1054 transitions, 14232 flow [2025-04-13 19:53:39,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 19:53:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 19:53:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 578 transitions. [2025-04-13 19:53:39,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.621505376344086 [2025-04-13 19:53:39,322 INFO L175 Difference]: Start difference. First operand has 176 places, 425 transitions, 5091 flow. Second operand 30 states and 578 transitions. [2025-04-13 19:53:39,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1054 transitions, 14232 flow [2025-04-13 19:53:40,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 1054 transitions, 13939 flow, removed 61 selfloop flow, removed 5 redundant places. [2025-04-13 19:53:40,015 INFO L231 Difference]: Finished difference. Result has 211 places, 569 transitions, 7874 flow [2025-04-13 19:53:40,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4777, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=7874, PETRI_PLACES=211, PETRI_TRANSITIONS=569} [2025-04-13 19:53:40,015 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 176 predicate places. [2025-04-13 19:53:40,016 INFO L485 AbstractCegarLoop]: Abstraction has has 211 places, 569 transitions, 7874 flow [2025-04-13 19:53:40,016 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-13 19:53:40,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:40,016 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-13 19:53:40,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 19:53:40,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 19:53:40,216 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:53:40,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:40,217 INFO L85 PathProgramCache]: Analyzing trace with hash 741129732, now seen corresponding path program 6 times [2025-04-13 19:53:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:40,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118650856] [2025-04-13 19:53:40,217 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:53:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:40,221 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:53:40,225 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:53:40,225 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:53:40,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:40,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:40,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118650856] [2025-04-13 19:53:40,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118650856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:40,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664237060] [2025-04-13 19:53:40,289 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:53:40,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:40,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:40,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:40,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 19:53:40,322 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:53:40,444 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:53:40,444 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:53:40,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:40,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:53:40,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:41,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:49,858 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-13 19:53:49,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664237060] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:53:49,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:53:49,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-13 19:53:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891835056] [2025-04-13 19:53:49,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:53:49,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:53:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:49,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:53:49,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=198, Unknown=1, NotChecked=0, Total=272 [2025-04-13 19:53:49,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:53:49,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 569 transitions, 7874 flow. Second operand has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 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-13 19:53:49,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:49,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:53:49,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:52,889 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:54,004 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:02,466 INFO L116 PetriNetUnfolderBase]: 13535/18654 cut-off events. [2025-04-13 19:54:02,466 INFO L117 PetriNetUnfolderBase]: For 416240/416240 co-relation queries the response was YES. [2025-04-13 19:54:02,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161185 conditions, 18654 events. 13535/18654 cut-off events. For 416240/416240 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 103836 event pairs, 1051 based on Foata normal form. 102/18746 useless extension candidates. Maximal degree in co-relation 160053. Up to 6465 conditions per place. [2025-04-13 19:54:02,677 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 704 selfloop transitions, 266 changer transitions 10/984 dead transitions. [2025-04-13 19:54:02,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 984 transitions, 15589 flow [2025-04-13 19:54:02,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 19:54:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 19:54:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 285 transitions. [2025-04-13 19:54:02,679 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6566820276497696 [2025-04-13 19:54:02,679 INFO L175 Difference]: Start difference. First operand has 211 places, 569 transitions, 7874 flow. Second operand 14 states and 285 transitions. [2025-04-13 19:54:02,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 984 transitions, 15589 flow [2025-04-13 19:54:05,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 984 transitions, 14087 flow, removed 667 selfloop flow, removed 5 redundant places. [2025-04-13 19:54:05,116 INFO L231 Difference]: Finished difference. Result has 226 places, 658 transitions, 9370 flow [2025-04-13 19:54:05,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6980, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9370, PETRI_PLACES=226, PETRI_TRANSITIONS=658} [2025-04-13 19:54:05,117 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 191 predicate places. [2025-04-13 19:54:05,117 INFO L485 AbstractCegarLoop]: Abstraction has has 226 places, 658 transitions, 9370 flow [2025-04-13 19:54:05,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 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-13 19:54:05,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:54:05,117 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-13 19:54:05,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 19:54:05,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 19:54:05,318 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:54:05,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:54:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1438929661, now seen corresponding path program 3 times [2025-04-13 19:54:05,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:54:05,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665197934] [2025-04-13 19:54:05,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:54:05,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:54:05,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:54:05,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:54:05,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:54:05,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:54:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:54:05,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:54:05,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665197934] [2025-04-13 19:54:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665197934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:54:05,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340167390] [2025-04-13 19:54:05,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:54:05,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:54:05,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:54:05,388 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:54:05,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 19:54:05,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:54:05,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:54:05,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:54:05,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:54:05,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:54:05,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:54:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:54:14,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:54:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:54:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340167390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:54:25,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:54:25,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:54:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962790863] [2025-04-13 19:54:25,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:54:25,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:54:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:54:25,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:54:25,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=178, Unknown=1, NotChecked=0, Total=240 [2025-04-13 19:54:25,784 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:54:25,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 658 transitions, 9370 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-13 19:54:25,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:54:25,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:54:25,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:54:50,861 WARN L286 SmtUtils]: Spent 23.22s on a formula simplification. DAG size of input: 40 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:54:55,381 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-13 19:54:56,688 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:03,275 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-13 19:55:06,308 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:10,427 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:16,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:17,303 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-13 19:55:21,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-13 19:55:25,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-13 19:55:29,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:30,507 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:34,872 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:44,430 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:50,071 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-13 19:55:54,074 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-13 19:56:01,436 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-13 19:56:05,770 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:08,270 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:10,090 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:12,255 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:13,720 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-13 19:56:17,211 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:20,207 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:27,535 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:32,804 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:33,619 INFO L116 PetriNetUnfolderBase]: 38537/53637 cut-off events. [2025-04-13 19:56:33,619 INFO L117 PetriNetUnfolderBase]: For 1491888/1491888 co-relation queries the response was YES. [2025-04-13 19:56:34,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507301 conditions, 53637 events. 38537/53637 cut-off events. For 1491888/1491888 co-relation queries the response was YES. Maximal size of possible extension queue 2140. Compared 343029 event pairs, 2236 based on Foata normal form. 805/54432 useless extension candidates. Maximal degree in co-relation 505517. Up to 23406 conditions per place. [2025-04-13 19:56:34,388 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1585 selfloop transitions, 731 changer transitions 159/2479 dead transitions. [2025-04-13 19:56:34,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2479 transitions, 42645 flow [2025-04-13 19:56:34,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 19:56:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 19:56:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 649 transitions. [2025-04-13 19:56:34,390 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7476958525345622 [2025-04-13 19:56:34,390 INFO L175 Difference]: Start difference. First operand has 226 places, 658 transitions, 9370 flow. Second operand 28 states and 649 transitions. [2025-04-13 19:56:34,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2479 transitions, 42645 flow [2025-04-13 19:56:45,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 2479 transitions, 41328 flow, removed 643 selfloop flow, removed 4 redundant places. [2025-04-13 19:56:45,694 INFO L231 Difference]: Finished difference. Result has 266 places, 1160 transitions, 21454 flow [2025-04-13 19:56:45,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=8975, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=21454, PETRI_PLACES=266, PETRI_TRANSITIONS=1160} [2025-04-13 19:56:45,695 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 231 predicate places. [2025-04-13 19:56:45,695 INFO L485 AbstractCegarLoop]: Abstraction has has 266 places, 1160 transitions, 21454 flow [2025-04-13 19:56:45,695 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-13 19:56:45,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:56:45,695 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-13 19:56:45,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 19:56:45,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 19:56:45,896 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:56:45,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:56:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash -515864473, now seen corresponding path program 4 times [2025-04-13 19:56:45,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:56:45,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043945415] [2025-04-13 19:56:45,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:56:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:56:45,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:56:45,904 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:56:45,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:56:45,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:56:45,966 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-13 19:56:45,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:56:45,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043945415] [2025-04-13 19:56:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043945415] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:56:45,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64863449] [2025-04-13 19:56:45,966 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:56:45,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:56:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:56:45,973 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:56:45,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 19:56:46,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:56:46,343 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:56:46,343 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:56:46,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:56:46,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:56:46,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:56:47,602 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-13 19:56:47,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:56:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:56:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64863449] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:56:55,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:56:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 19:56:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481569671] [2025-04-13 19:56:55,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:56:55,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:56:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:56:55,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:56:55,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=174, Unknown=1, NotChecked=0, Total=240 [2025-04-13 19:56:55,453 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:56:55,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 1160 transitions, 21454 flow. Second operand has 16 states, 16 states have (on average 11.625) internal successors, (186), 16 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:56:55,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:56:55,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:56:55,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:57:16,067 WARN L286 SmtUtils]: Spent 20.51s on a formula simplification. DAG size of input: 40 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:57:36,296 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-13 19:57:43,748 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:45,891 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:52,053 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:54,802 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:59,135 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:12,408 INFO L116 PetriNetUnfolderBase]: 40865/57088 cut-off events. [2025-04-13 19:58:12,408 INFO L117 PetriNetUnfolderBase]: For 2295908/2295908 co-relation queries the response was YES. [2025-04-13 19:58:13,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626424 conditions, 57088 events. 40865/57088 cut-off events. For 2295908/2295908 co-relation queries the response was YES. Maximal size of possible extension queue 2450. Compared 373926 event pairs, 2668 based on Foata normal form. 1708/58792 useless extension candidates. Maximal degree in co-relation 625386. Up to 25035 conditions per place. [2025-04-13 19:58:13,495 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1543 selfloop transitions, 657 changer transitions 123/2327 dead transitions. [2025-04-13 19:58:13,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 2327 transitions, 47107 flow [2025-04-13 19:58:13,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 19:58:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 19:58:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 531 transitions. [2025-04-13 19:58:13,497 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7137096774193549 [2025-04-13 19:58:13,497 INFO L175 Difference]: Start difference. First operand has 266 places, 1160 transitions, 21454 flow. Second operand 24 states and 531 transitions. [2025-04-13 19:58:13,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 2327 transitions, 47107 flow [2025-04-13 19:58:28,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 2327 transitions, 44017 flow, removed 1536 selfloop flow, removed 4 redundant places. [2025-04-13 19:58:28,553 INFO L231 Difference]: Finished difference. Result has 293 places, 1235 transitions, 25186 flow [2025-04-13 19:58:28,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=15851, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=401, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=25186, PETRI_PLACES=293, PETRI_TRANSITIONS=1235} [2025-04-13 19:58:28,554 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 258 predicate places. [2025-04-13 19:58:28,554 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 1235 transitions, 25186 flow [2025-04-13 19:58:28,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.625) internal successors, (186), 16 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:28,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:28,554 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-13 19:58:28,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 19:58:28,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:28,755 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:58:28,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash -33425921, now seen corresponding path program 5 times [2025-04-13 19:58:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:28,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475138145] [2025-04-13 19:58:28,756 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:58:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:28,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:58:28,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:58:28,762 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:28,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:28,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:28,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475138145] [2025-04-13 19:58:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475138145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:28,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130810614] [2025-04-13 19:58:28,912 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:58:28,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:28,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:28,914 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:58:28,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 19:58:28,955 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:58:29,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:58:29,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:29,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:29,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:58:29,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:29,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:29,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130810614] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:58:29,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:58:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-13 19:58:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334250170] [2025-04-13 19:58:29,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:58:29,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:58:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:29,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:58:29,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:58:29,948 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:58:29,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1235 transitions, 25186 flow. Second operand has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 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-13 19:58:29,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:29,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:58:29,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:32,662 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:48,688 INFO L116 PetriNetUnfolderBase]: 50097/69216 cut-off events. [2025-04-13 19:58:48,688 INFO L117 PetriNetUnfolderBase]: For 3057181/3057181 co-relation queries the response was YES. [2025-04-13 19:58:49,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796385 conditions, 69216 events. 50097/69216 cut-off events. For 3057181/3057181 co-relation queries the response was YES. Maximal size of possible extension queue 3026. Compared 449423 event pairs, 7651 based on Foata normal form. 1238/70444 useless extension candidates. Maximal degree in co-relation 795278. Up to 46558 conditions per place. [2025-04-13 19:58:50,204 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 1764 selfloop transitions, 298 changer transitions 4/2070 dead transitions. [2025-04-13 19:58:50,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 2070 transitions, 45763 flow [2025-04-13 19:58:50,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:58:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 19:58:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 333 transitions. [2025-04-13 19:58:50,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7161290322580646 [2025-04-13 19:58:50,206 INFO L175 Difference]: Start difference. First operand has 293 places, 1235 transitions, 25186 flow. Second operand 15 states and 333 transitions. [2025-04-13 19:58:50,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 2070 transitions, 45763 flow [2025-04-13 19:59:11,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 2070 transitions, 43848 flow, removed 940 selfloop flow, removed 5 redundant places. [2025-04-13 19:59:11,608 INFO L231 Difference]: Finished difference. Result has 304 places, 1326 transitions, 26975 flow [2025-04-13 19:59:11,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=23519, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=992, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=26975, PETRI_PLACES=304, PETRI_TRANSITIONS=1326} [2025-04-13 19:59:11,609 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 269 predicate places. [2025-04-13 19:59:11,610 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 1326 transitions, 26975 flow [2025-04-13 19:59:11,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 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-13 19:59:11,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:11,610 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-13 19:59:11,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 19:59:11,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:11,810 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:59:11,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash 19429118, now seen corresponding path program 6 times [2025-04-13 19:59:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:11,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785923529] [2025-04-13 19:59:11,811 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:11,814 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:59:11,818 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:59:11,818 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:59:11,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:11,876 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-13 19:59:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:11,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785923529] [2025-04-13 19:59:11,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785923529] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:11,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130740509] [2025-04-13 19:59:11,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:11,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:11,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:11,878 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:11,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 19:59:11,908 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 19:59:12,024 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:59:12,024 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:59:12,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:12,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:59:12,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2025-04-13 20:00:03,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:00:03,055 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-13 20:00:04,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:00:04,257 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 20:00:04,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 20:00:04,270 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 20:00:04,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:00:04,272 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2025-04-13 20:00:04,274 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 20:00:04,274 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 20:00:04,274 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 20:00:04,274 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 20:00:04,274 INFO L422 BasicCegarLoop]: Path program histogram: [6, 6, 2, 2, 2, 2, 1] [2025-04-13 20:00:04,282 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:00:04,282 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:00:04,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:00:04 BasicIcfg [2025-04-13 20:00:04,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:00:04,292 INFO L158 Benchmark]: Toolchain (without parser) took 858980.70ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 99.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 20:00:04,292 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:04,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.15ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 84.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:00:04,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.24ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:00:04,293 INFO L158 Benchmark]: Boogie Preprocessor took 30.99ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 81.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:04,293 INFO L158 Benchmark]: RCFGBuilder took 368.25ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 51.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 20:00:04,293 INFO L158 Benchmark]: TraceAbstraction took 858337.81ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 50.8MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 20:00:04,294 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.21ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.15ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 84.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.24ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.99ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 81.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 368.25ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 51.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 858337.81ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 50.8MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.7GB. 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 analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - 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: 858.2s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 514.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 2654 SdHoareTripleChecker+Valid, 250.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2654 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 249.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8538 IncrementalHoareTripleChecker+Invalid, 8853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 0 mSDtfsCounter, 8538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 880 GetRequests, 594 SyntacticMatches, 9 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 364.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26975occurred in iteration=20, InterpolantAutomatonStates: 235, 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, 1.9s SatisfiabilityAnalysisTime, 285.6s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1153 ConstructedInterpolants, 0 QuantifiedInterpolants, 20163 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2379 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 50 InterpolantComputations, 5 PerfectInterpolantSequences, 14/115 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