/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/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:59:16,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:59:16,929 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 20:59:16,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:59:16,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:59:16,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:59:16,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:59:16,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:59:16,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:59:16,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:59:16,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:59:16,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:59:16,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:59:16,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:59:16,953 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:59:16,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:59:16,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:59:16,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:59:16,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:59:16,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:59:16,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:59:16,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:59:16,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:16,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:16,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:59:16,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:59:16,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:59:16,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:59:16,957 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 20:59:17,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:59:17,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:59:17,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:59:17,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:59:17,189 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:59:17,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2025-04-13 20:59:18,494 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3e5d976/c2b2f076ad0d4ae180a88d80f1771d01/FLAG04d015126 [2025-04-13 20:59:18,664 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:59:18,665 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2025-04-13 20:59:18,671 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3e5d976/c2b2f076ad0d4ae180a88d80f1771d01/FLAG04d015126 [2025-04-13 20:59:19,696 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3e5d976/c2b2f076ad0d4ae180a88d80f1771d01 [2025-04-13 20:59:19,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:59:19,699 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:59:19,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:59:19,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:59:19,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:59:19,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9681c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19, skipping insertion in model container [2025-04-13 20:59:19,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:59:19,873 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/test-easy1.wvr.c[1902,1915] [2025-04-13 20:59:19,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:59:19,884 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:59:19,905 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/test-easy1.wvr.c[1902,1915] [2025-04-13 20:59:19,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:59:19,917 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:59:19,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19 WrapperNode [2025-04-13 20:59:19,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:59:19,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:59:19,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:59:19,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:59:19,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,946 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2025-04-13 20:59:19,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:59:19,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:59:19,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:59:19,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:59:19,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,960 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 20:59:19,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:59:19,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:59:19,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:59:19,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:59:19,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (1/1) ... [2025-04-13 20:59:19,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:19,998 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 20:59:20,000 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 20:59:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:59:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:59:20,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:59:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:59:20,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:59:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:59:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:59:20,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:59:20,024 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 20:59:20,079 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:59:20,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:59:20,178 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:59:20,178 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:59:20,179 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:59:20,279 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:59:20,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:59:20 BoogieIcfgContainer [2025-04-13 20:59:20,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:59:20,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:59:20,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:59:20,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:59:20,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:59:19" (1/3) ... [2025-04-13 20:59:20,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4546c704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:59:20, skipping insertion in model container [2025-04-13 20:59:20,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:19" (2/3) ... [2025-04-13 20:59:20,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4546c704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:59:20, skipping insertion in model container [2025-04-13 20:59:20,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:59:20" (3/3) ... [2025-04-13 20:59:20,286 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy1.wvr.c [2025-04-13 20:59:20,296 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:59:20,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy1.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:59:20,297 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:59:20,331 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:59:20,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 20:59:20,380 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-13 20:59:20,381 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:59:20,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 20:59:20,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 20:59:20,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-13 20:59:20,393 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:59:20,405 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;@c123bfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:59:20,405 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:59:20,411 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:59:20,411 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-13 20:59:20,411 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:59:20,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:20,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:20,412 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:20,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1573974174, now seen corresponding path program 1 times [2025-04-13 20:59:20,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:20,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104512302] [2025-04-13 20:59:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:20,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:59:20,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:59:20,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:20,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:20,591 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 20:59:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:20,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104512302] [2025-04-13 20:59:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104512302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:59:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181652185] [2025-04-13 20:59:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:20,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:59:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:20,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:59:20,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:59:20,614 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:20,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 20:59:20,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:20,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:20,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:20,677 INFO L116 PetriNetUnfolderBase]: 59/103 cut-off events. [2025-04-13 20:59:20,677 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-13 20:59:20,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 103 events. 59/103 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 284 event pairs, 8 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 179. Up to 77 conditions per place. [2025-04-13 20:59:20,679 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 17 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2025-04-13 20:59:20,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 109 flow [2025-04-13 20:59:20,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:59:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:59:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 20:59:20,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 20:59:20,690 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 40 flow. Second operand 3 states and 34 transitions. [2025-04-13 20:59:20,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 23 transitions, 109 flow [2025-04-13 20:59:20,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 23 transitions, 95 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:20,695 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 51 flow [2025-04-13 20:59:20,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=18, PETRI_TRANSITIONS=16} [2025-04-13 20:59:20,699 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2025-04-13 20:59:20,699 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 51 flow [2025-04-13 20:59:20,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 20:59:20,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:20,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:20,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:59:20,700 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:20,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1548583066, now seen corresponding path program 1 times [2025-04-13 20:59:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:20,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400671757] [2025-04-13 20:59:20,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:20,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:59:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:59:20,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:20,800 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 20:59:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:20,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400671757] [2025-04-13 20:59:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400671757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:20,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:20,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:59:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818121822] [2025-04-13 20:59:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:20,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:59:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:20,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:59:20,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:59:20,803 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:20,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 20:59:20,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:20,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:20,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:20,889 INFO L116 PetriNetUnfolderBase]: 60/113 cut-off events. [2025-04-13 20:59:20,890 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-13 20:59:20,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 113 events. 60/113 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 331 event pairs, 6 based on Foata normal form. 6/115 useless extension candidates. Maximal degree in co-relation 79. Up to 46 conditions per place. [2025-04-13 20:59:20,891 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 26 selfloop transitions, 7 changer transitions 2/37 dead transitions. [2025-04-13 20:59:20,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 37 transitions, 181 flow [2025-04-13 20:59:20,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:59:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:59:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-13 20:59:20,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2025-04-13 20:59:20,892 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 51 flow. Second operand 5 states and 53 transitions. [2025-04-13 20:59:20,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 37 transitions, 181 flow [2025-04-13 20:59:20,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 37 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:59:20,893 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 104 flow [2025-04-13 20:59:20,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2025-04-13 20:59:20,893 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2025-04-13 20:59:20,894 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 104 flow [2025-04-13 20:59:20,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 20:59:20,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:20,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:20,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:59:20,894 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:20,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1076637827, now seen corresponding path program 1 times [2025-04-13 20:59:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:20,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746078957] [2025-04-13 20:59:20,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:20,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:59:20,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:59:20,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:20,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:20,982 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 20:59:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:20,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746078957] [2025-04-13 20:59:20,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746078957] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:20,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281163088] [2025-04-13 20:59:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:20,987 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 20:59:20,988 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 20:59:21,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:59:21,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:59:21,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:21,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:21,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 20:59:21,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:21,105 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 20:59:21,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:21,161 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 20:59:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281163088] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:21,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2025-04-13 20:59:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985538537] [2025-04-13 20:59:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:21,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:59:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:21,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:59:21,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:59:21,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:21,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 20:59:21,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:21,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:21,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:21,222 INFO L116 PetriNetUnfolderBase]: 61/130 cut-off events. [2025-04-13 20:59:21,222 INFO L117 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-04-13 20:59:21,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 130 events. 61/130 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 432 event pairs, 11 based on Foata normal form. 5/130 useless extension candidates. Maximal degree in co-relation 288. Up to 52 conditions per place. [2025-04-13 20:59:21,224 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 28 selfloop transitions, 8 changer transitions 2/40 dead transitions. [2025-04-13 20:59:21,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 40 transitions, 254 flow [2025-04-13 20:59:21,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:59:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:59:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-13 20:59:21,225 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-13 20:59:21,225 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 104 flow. Second operand 4 states and 46 transitions. [2025-04-13 20:59:21,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 40 transitions, 254 flow [2025-04-13 20:59:21,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 40 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:59:21,227 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 151 flow [2025-04-13 20:59:21,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-04-13 20:59:21,228 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 10 predicate places. [2025-04-13 20:59:21,228 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 151 flow [2025-04-13 20:59:21,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 20:59:21,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:21,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:21,235 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 20:59:21,432 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 20:59:21,432 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:21,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 842070695, now seen corresponding path program 2 times [2025-04-13 20:59:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:21,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389074038] [2025-04-13 20:59:21,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:21,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:59:21,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:59:21,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:21,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:21,494 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 20:59:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:21,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389074038] [2025-04-13 20:59:21,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389074038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:21,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:59:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105011135] [2025-04-13 20:59:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:21,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:59:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:21,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:59:21,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:59:21,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:21,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 20:59:21,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:21,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:21,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:21,561 INFO L116 PetriNetUnfolderBase]: 51/108 cut-off events. [2025-04-13 20:59:21,561 INFO L117 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-04-13 20:59:21,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 108 events. 51/108 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 317 event pairs, 6 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 275. Up to 39 conditions per place. [2025-04-13 20:59:21,562 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 28 selfloop transitions, 7 changer transitions 2/39 dead transitions. [2025-04-13 20:59:21,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 289 flow [2025-04-13 20:59:21,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:59:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:59:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-04-13 20:59:21,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-04-13 20:59:21,564 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 151 flow. Second operand 5 states and 50 transitions. [2025-04-13 20:59:21,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 289 flow [2025-04-13 20:59:21,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 285 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 20:59:21,566 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 170 flow [2025-04-13 20:59:21,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2025-04-13 20:59:21,567 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 15 predicate places. [2025-04-13 20:59:21,567 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 170 flow [2025-04-13 20:59:21,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 20:59:21,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:21,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:21,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:59:21,569 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:21,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1646104000, now seen corresponding path program 2 times [2025-04-13 20:59:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:21,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766402427] [2025-04-13 20:59:21,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:21,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:59:21,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:59:21,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:21,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:21,601 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 20:59:21,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:21,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766402427] [2025-04-13 20:59:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766402427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:21,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456371331] [2025-04-13 20:59:21,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:21,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:21,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:21,604 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 20:59:21,605 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 20:59:21,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:59:21,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:59:21,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:21,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:21,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:59:21,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:21,704 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 20:59:21,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:21,784 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 20:59:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456371331] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:21,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:21,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2025-04-13 20:59:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127231537] [2025-04-13 20:59:21,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:21,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:21,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:21,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:21,785 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:21,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 20:59:21,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:21,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:21,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:21,855 INFO L116 PetriNetUnfolderBase]: 77/159 cut-off events. [2025-04-13 20:59:21,855 INFO L117 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2025-04-13 20:59:21,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 159 events. 77/159 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 539 event pairs, 6 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 345. Up to 61 conditions per place. [2025-04-13 20:59:21,856 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 33 selfloop transitions, 13 changer transitions 4/52 dead transitions. [2025-04-13 20:59:21,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 417 flow [2025-04-13 20:59:21,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:59:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:59:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-04-13 20:59:21,858 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2025-04-13 20:59:21,858 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 170 flow. Second operand 5 states and 58 transitions. [2025-04-13 20:59:21,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 417 flow [2025-04-13 20:59:21,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 396 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:59:21,861 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 280 flow [2025-04-13 20:59:21,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-04-13 20:59:21,864 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 22 predicate places. [2025-04-13 20:59:21,865 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 280 flow [2025-04-13 20:59:21,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 20:59:21,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:21,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:21,871 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 20:59:22,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:22,066 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:22,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -230890191, now seen corresponding path program 1 times [2025-04-13 20:59:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:22,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558506424] [2025-04-13 20:59:22,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:22,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:59:22,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:22,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:22,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:22,175 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 20:59:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:22,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558506424] [2025-04-13 20:59:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558506424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:22,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43380642] [2025-04-13 20:59:22,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:22,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:22,178 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 20:59:22,179 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 20:59:22,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:59:22,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:22,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:22,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:22,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:59:22,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:22,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:22,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43380642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:22,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:22,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 8 [2025-04-13 20:59:22,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634159635] [2025-04-13 20:59:22,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:22,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:59:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:22,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:59:22,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:22,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:22,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:22,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:22,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:22,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:22,323 INFO L116 PetriNetUnfolderBase]: 73/150 cut-off events. [2025-04-13 20:59:22,323 INFO L117 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2025-04-13 20:59:22,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 150 events. 73/150 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 491 event pairs, 3 based on Foata normal form. 2/150 useless extension candidates. Maximal degree in co-relation 504. Up to 57 conditions per place. [2025-04-13 20:59:22,324 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 26 selfloop transitions, 4 changer transitions 20/52 dead transitions. [2025-04-13 20:59:22,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 493 flow [2025-04-13 20:59:22,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 20:59:22,325 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-04-13 20:59:22,325 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 280 flow. Second operand 6 states and 58 transitions. [2025-04-13 20:59:22,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 493 flow [2025-04-13 20:59:22,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 453 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:22,329 INFO L231 Difference]: Finished difference. Result has 47 places, 26 transitions, 220 flow [2025-04-13 20:59:22,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=47, PETRI_TRANSITIONS=26} [2025-04-13 20:59:22,329 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 28 predicate places. [2025-04-13 20:59:22,329 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 26 transitions, 220 flow [2025-04-13 20:59:22,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:22,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:22,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:22,336 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 20:59:22,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:22,530 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:22,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2128542429, now seen corresponding path program 2 times [2025-04-13 20:59:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:22,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691080845] [2025-04-13 20:59:22,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:22,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:59:22,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:22,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:22,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:22,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:22,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691080845] [2025-04-13 20:59:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691080845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:22,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724039151] [2025-04-13 20:59:22,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:22,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:22,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:22,609 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 20:59:22,610 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 20:59:22,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:59:22,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:22,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:22,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:22,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:59:22,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:22,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724039151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-04-13 20:59:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320143909] [2025-04-13 20:59:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:22,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:59:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:22,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:59:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:59:22,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:22,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 26 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:22,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:22,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:22,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:22,737 INFO L116 PetriNetUnfolderBase]: 41/83 cut-off events. [2025-04-13 20:59:22,738 INFO L117 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-04-13 20:59:22,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 83 events. 41/83 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 190 event pairs, 6 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 409. Up to 31 conditions per place. [2025-04-13 20:59:22,739 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 4 changer transitions 11/37 dead transitions. [2025-04-13 20:59:22,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 345 flow [2025-04-13 20:59:22,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2025-04-13 20:59:22,740 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2025-04-13 20:59:22,740 INFO L175 Difference]: Start difference. First operand has 47 places, 26 transitions, 220 flow. Second operand 6 states and 50 transitions. [2025-04-13 20:59:22,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 345 flow [2025-04-13 20:59:22,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 318 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-13 20:59:22,743 INFO L231 Difference]: Finished difference. Result has 45 places, 21 transitions, 160 flow [2025-04-13 20:59:22,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2025-04-13 20:59:22,744 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 26 predicate places. [2025-04-13 20:59:22,744 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 21 transitions, 160 flow [2025-04-13 20:59:22,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:22,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:22,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:22,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:22,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:22,949 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:22,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1851987351, now seen corresponding path program 3 times [2025-04-13 20:59:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:22,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725390239] [2025-04-13 20:59:22,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:22,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:59:22,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:22,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:22,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:23,027 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 20:59:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:23,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725390239] [2025-04-13 20:59:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725390239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:23,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598110625] [2025-04-13 20:59:23,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:23,031 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 20:59:23,032 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 20:59:23,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:59:23,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:23,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:23,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:23,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:59:23,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:23,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598110625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 8 [2025-04-13 20:59:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4684284] [2025-04-13 20:59:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:23,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:59:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:23,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:59:23,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:23,118 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:23,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 21 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:23,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:23,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:23,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:23,188 INFO L116 PetriNetUnfolderBase]: 39/87 cut-off events. [2025-04-13 20:59:23,188 INFO L117 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2025-04-13 20:59:23,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 87 events. 39/87 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 211 event pairs, 9 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 408. Up to 31 conditions per place. [2025-04-13 20:59:23,189 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 23 selfloop transitions, 7 changer transitions 4/36 dead transitions. [2025-04-13 20:59:23,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 312 flow [2025-04-13 20:59:23,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2025-04-13 20:59:23,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2025-04-13 20:59:23,191 INFO L175 Difference]: Start difference. First operand has 45 places, 21 transitions, 160 flow. Second operand 6 states and 53 transitions. [2025-04-13 20:59:23,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 312 flow [2025-04-13 20:59:23,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 271 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-04-13 20:59:23,193 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 182 flow [2025-04-13 20:59:23,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2025-04-13 20:59:23,193 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 24 predicate places. [2025-04-13 20:59:23,193 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 182 flow [2025-04-13 20:59:23,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:23,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:23,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:23,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:23,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:23,399 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:23,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1849479141, now seen corresponding path program 4 times [2025-04-13 20:59:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:23,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840396418] [2025-04-13 20:59:23,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:23,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:59:23,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:23,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:23,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:23,438 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 20:59:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:23,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840396418] [2025-04-13 20:59:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840396418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:23,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509517328] [2025-04-13 20:59:23,439 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:23,441 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 20:59:23,442 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 20:59:23,467 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:59:23,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:59:23,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:23,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:23,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:59:23,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:23,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509517328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [2] total 7 [2025-04-13 20:59:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147803040] [2025-04-13 20:59:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:23,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:59:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:23,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:59:23,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:59:23,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:23,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 23 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:23,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:23,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:23,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:23,565 INFO L116 PetriNetUnfolderBase]: 37/80 cut-off events. [2025-04-13 20:59:23,565 INFO L117 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-04-13 20:59:23,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 80 events. 37/80 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 184 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 383. Up to 31 conditions per place. [2025-04-13 20:59:23,566 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 15 selfloop transitions, 1 changer transitions 16/34 dead transitions. [2025-04-13 20:59:23,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 304 flow [2025-04-13 20:59:23,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-04-13 20:59:23,568 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:59:23,568 INFO L175 Difference]: Start difference. First operand has 43 places, 23 transitions, 182 flow. Second operand 6 states and 51 transitions. [2025-04-13 20:59:23,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 304 flow [2025-04-13 20:59:23,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 295 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:23,570 INFO L231 Difference]: Finished difference. Result has 47 places, 17 transitions, 106 flow [2025-04-13 20:59:23,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=17} [2025-04-13 20:59:23,570 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 28 predicate places. [2025-04-13 20:59:23,570 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 17 transitions, 106 flow [2025-04-13 20:59:23,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 20:59:23,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:23,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:23,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:59:23,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:23,775 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:23,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1200872714, now seen corresponding path program 5 times [2025-04-13 20:59:23,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:23,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481590764] [2025-04-13 20:59:23,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:23,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:23,780 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:59:23,784 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:59:23,784 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:23,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:23,823 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 20:59:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:23,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481590764] [2025-04-13 20:59:23,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481590764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:23,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767485371] [2025-04-13 20:59:23,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:23,826 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 20:59:23,827 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 20:59:23,850 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:59:23,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:59:23,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:23,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:59:23,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:23,910 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 20:59:23,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767485371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:23,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 20:59:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700491682] [2025-04-13 20:59:23,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:23,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:59:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:23,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:59:23,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:59:23,956 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:23,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 17 transitions, 106 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 20:59:23,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:23,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:23,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:24,035 INFO L116 PetriNetUnfolderBase]: 21/53 cut-off events. [2025-04-13 20:59:24,035 INFO L117 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2025-04-13 20:59:24,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 53 events. 21/53 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 5/57 useless extension candidates. Maximal degree in co-relation 239. Up to 19 conditions per place. [2025-04-13 20:59:24,036 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 6 changer transitions 3/31 dead transitions. [2025-04-13 20:59:24,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 31 transitions, 220 flow [2025-04-13 20:59:24,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:59:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:59:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2025-04-13 20:59:24,038 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2025-04-13 20:59:24,038 INFO L175 Difference]: Start difference. First operand has 47 places, 17 transitions, 106 flow. Second operand 8 states and 63 transitions. [2025-04-13 20:59:24,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 31 transitions, 220 flow [2025-04-13 20:59:24,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 191 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:24,039 INFO L231 Difference]: Finished difference. Result has 43 places, 18 transitions, 113 flow [2025-04-13 20:59:24,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=18} [2025-04-13 20:59:24,041 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 24 predicate places. [2025-04-13 20:59:24,041 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 18 transitions, 113 flow [2025-04-13 20:59:24,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 20:59:24,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:24,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:24,047 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 20:59:24,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:24,242 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:24,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash -869127422, now seen corresponding path program 6 times [2025-04-13 20:59:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:24,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066582927] [2025-04-13 20:59:24,243 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:24,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:24,246 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 3 equivalence classes. [2025-04-13 20:59:24,249 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:24,250 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:59:24,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:59:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:24,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066582927] [2025-04-13 20:59:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066582927] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:24,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911964119] [2025-04-13 20:59:24,305 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:24,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:24,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:24,310 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 20:59:24,311 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 20:59:24,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 3 equivalence classes. [2025-04-13 20:59:24,346 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:24,346 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:59:24,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:24,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:59:24,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:59:24,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911964119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:24,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-04-13 20:59:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982500518] [2025-04-13 20:59:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:24,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:59:24,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:24,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:59:24,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:24,393 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:24,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 18 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 20:59:24,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:24,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:24,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:24,426 INFO L116 PetriNetUnfolderBase]: 19/52 cut-off events. [2025-04-13 20:59:24,426 INFO L117 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-04-13 20:59:24,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 52 events. 19/52 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 172. Up to 18 conditions per place. [2025-04-13 20:59:24,427 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 19 selfloop transitions, 3 changer transitions 4/28 dead transitions. [2025-04-13 20:59:24,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 28 transitions, 195 flow [2025-04-13 20:59:24,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2025-04-13 20:59:24,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-04-13 20:59:24,427 INFO L175 Difference]: Start difference. First operand has 43 places, 18 transitions, 113 flow. Second operand 6 states and 49 transitions. [2025-04-13 20:59:24,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 28 transitions, 195 flow [2025-04-13 20:59:24,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 28 transitions, 166 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:24,428 INFO L231 Difference]: Finished difference. Result has 42 places, 18 transitions, 95 flow [2025-04-13 20:59:24,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=42, PETRI_TRANSITIONS=18} [2025-04-13 20:59:24,429 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 23 predicate places. [2025-04-13 20:59:24,429 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 18 transitions, 95 flow [2025-04-13 20:59:24,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 20:59:24,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:24,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:24,436 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 20:59:24,629 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,SelfDestructingSolverStorable10 [2025-04-13 20:59:24,630 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:24,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1574034474, now seen corresponding path program 7 times [2025-04-13 20:59:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:24,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007630973] [2025-04-13 20:59:24,630 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:24,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:24,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:24,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:24,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:24,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007630973] [2025-04-13 20:59:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007630973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:24,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107848724] [2025-04-13 20:59:24,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:24,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:24,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:24,712 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 20:59:24,713 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 20:59:24,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:24,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:24,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:24,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:24,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:59:24,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:59:24,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107848724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-04-13 20:59:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070710850] [2025-04-13 20:59:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:24,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:59:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:24,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:59:24,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:59:24,787 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 20:59:24,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 18 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 20:59:24,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:24,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 20:59:24,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:24,819 INFO L116 PetriNetUnfolderBase]: 18/46 cut-off events. [2025-04-13 20:59:24,819 INFO L117 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-04-13 20:59:24,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 46 events. 18/46 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 179. Up to 18 conditions per place. [2025-04-13 20:59:24,819 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2025-04-13 20:59:24,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 25 transitions, 164 flow [2025-04-13 20:59:24,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-04-13 20:59:24,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-13 20:59:24,820 INFO L175 Difference]: Start difference. First operand has 42 places, 18 transitions, 95 flow. Second operand 6 states and 46 transitions. [2025-04-13 20:59:24,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 25 transitions, 164 flow [2025-04-13 20:59:24,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 25 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:59:24,821 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2025-04-13 20:59:24,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2025-04-13 20:59:24,822 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 23 predicate places. [2025-04-13 20:59:24,822 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2025-04-13 20:59:24,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 20:59:24,825 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:59:24,826 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:59:24,826 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:59:24,832 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 20:59:25,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:25,030 INFO L422 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1] [2025-04-13 20:59:25,033 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:59:25,033 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:59:25,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:59:25 BasicIcfg [2025-04-13 20:59:25,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:59:25,041 INFO L158 Benchmark]: Toolchain (without parser) took 5341.80ms. Allocated memory is still 155.2MB. Free memory was 112.6MB in the beginning and 82.1MB in the end (delta: 30.5MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2025-04-13 20:59:25,041 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:59:25,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.75ms. Allocated memory is still 155.2MB. Free memory was 112.6MB in the beginning and 98.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:59:25,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.83ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 96.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:59:25,041 INFO L158 Benchmark]: Boogie Preprocessor took 22.14ms. Allocated memory is still 155.2MB. Free memory was 96.7MB in the beginning and 95.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:59:25,041 INFO L158 Benchmark]: RCFGBuilder took 310.61ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 73.0MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 20:59:25,042 INFO L158 Benchmark]: TraceAbstraction took 4759.28ms. Allocated memory is still 155.2MB. Free memory was 72.2MB in the beginning and 82.1MB in the end (delta: -9.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:59:25,042 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.22ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.75ms. Allocated memory is still 155.2MB. Free memory was 112.6MB in the beginning and 98.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.83ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 96.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.14ms. Allocated memory is still 155.2MB. Free memory was 96.7MB in the beginning and 95.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 310.61ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 73.0MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4759.28ms. Allocated memory is still 155.2MB. Free memory was 72.2MB in the beginning and 82.1MB in the end (delta: -9.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 24 locations, 27 edges, 3 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: 4.7s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 630 IncrementalHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 0 mSDtfsCounter, 630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=5, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 1293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 43/65 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 20:59:25,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...