/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/pthread-theta/unwind2-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:08:16,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:08:16,820 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 21:08:16,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:08:16,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:08:16,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:08:16,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:08:16,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:08:16,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:08:16,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:08:16,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:08:16,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:08:16,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:08:16,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:08:16,843 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:08:16,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:08:16,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:08:16,844 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:08:16,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:16,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:16,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:08:16,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:08:16,845 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 21:08:17,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:08:17,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:08:17,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:08:17,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:08:17,097 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:08:17,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-13 21:08:18,377 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc1304aa/3839491e767e4f31b4d62e5e6d8205c2/FLAG397206bd9 [2025-04-13 21:08:18,618 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:08:18,618 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-13 21:08:18,630 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc1304aa/3839491e767e4f31b4d62e5e6d8205c2/FLAG397206bd9 [2025-04-13 21:08:20,476 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc1304aa/3839491e767e4f31b4d62e5e6d8205c2 [2025-04-13 21:08:20,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:08:20,481 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:08:20,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:08:20,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:08:20,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:08:20,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da14643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20, skipping insertion in model container [2025-04-13 21:08:20,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:08:20,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2025-04-13 21:08:20,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:08:20,822 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:08:20,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2025-04-13 21:08:20,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:08:20,900 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:08:20,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20 WrapperNode [2025-04-13 21:08:20,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:08:20,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:08:20,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:08:20,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:08:20,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,929 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-04-13 21:08:20,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:08:20,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:08:20,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:08:20,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:08:20,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,953 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 21:08:20,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:08:20,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:08:20,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:08:20,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:08:20,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (1/1) ... [2025-04-13 21:08:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:08:20,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:21,000 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 21:08:21,002 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 21:08:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:08:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 21:08:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 21:08:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 21:08:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 21:08:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:08:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:08:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:08:21,020 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 21:08:21,110 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:08:21,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:08:21,216 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:08:21,217 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:08:21,217 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:08:21,305 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:08:21,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:08:21 BoogieIcfgContainer [2025-04-13 21:08:21,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:08:21,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:08:21,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:08:21,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:08:21,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:08:20" (1/3) ... [2025-04-13 21:08:21,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43448a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:08:21, skipping insertion in model container [2025-04-13 21:08:21,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:08:20" (2/3) ... [2025-04-13 21:08:21,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43448a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:08:21, skipping insertion in model container [2025-04-13 21:08:21,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:08:21" (3/3) ... [2025-04-13 21:08:21,316 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-04-13 21:08:21,327 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:08:21,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 21 locations, 20 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 21:08:21,328 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:08:21,367 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:08:21,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 58 flow [2025-04-13 21:08:21,416 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-13 21:08:21,419 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:08:21,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-13 21:08:21,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 22 transitions, 58 flow [2025-04-13 21:08:21,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 45 flow [2025-04-13 21:08:21,428 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:08:21,436 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;@7b847bf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:08:21,436 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:08:21,440 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:08:21,440 INFO L116 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-04-13 21:08:21,440 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:08:21,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:21,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:08:21,441 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:21,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1968472706, now seen corresponding path program 1 times [2025-04-13 21:08:21,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:21,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565860410] [2025-04-13 21:08:21,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:21,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:21,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:08:21,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:08:21,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:21,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:21,692 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 21:08:21,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:21,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565860410] [2025-04-13 21:08:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565860410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:21,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:21,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989103528] [2025-04-13 21:08:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:21,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:21,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:21,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:21,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:21,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:21,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 45 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 21:08:21,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:21,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:21,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:21,981 INFO L116 PetriNetUnfolderBase]: 211/360 cut-off events. [2025-04-13 21:08:21,981 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 21:08:21,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 360 events. 211/360 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1345 event pairs, 26 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 690. Up to 153 conditions per place. [2025-04-13 21:08:21,986 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 49 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2025-04-13 21:08:21,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 57 transitions, 249 flow [2025-04-13 21:08:21,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-13 21:08:21,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2025-04-13 21:08:21,998 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 45 flow. Second operand 7 states and 75 transitions. [2025-04-13 21:08:21,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 57 transitions, 249 flow [2025-04-13 21:08:22,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 57 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:22,005 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 93 flow [2025-04-13 21:08:22,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=93, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-04-13 21:08:22,010 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2025-04-13 21:08:22,010 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 93 flow [2025-04-13 21:08:22,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 21:08:22,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:22,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:22,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:08:22,011 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:22,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash -893111565, now seen corresponding path program 1 times [2025-04-13 21:08:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:22,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433536572] [2025-04-13 21:08:22,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:22,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:08:22,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:08:22,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:22,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:22,126 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 21:08:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:22,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433536572] [2025-04-13 21:08:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433536572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:22,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046677089] [2025-04-13 21:08:22,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:22,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:22,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:22,128 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 21:08:22,130 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 21:08:22,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:08:22,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:08:22,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:22,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:22,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:08:22,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:22,228 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 21:08:22,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:22,290 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 21:08:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046677089] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:22,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:22,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 21:08:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574765717] [2025-04-13 21:08:22,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:22,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:08:22,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:22,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:08:22,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:08:22,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:22,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 93 flow. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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 21:08:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:22,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:22,716 INFO L116 PetriNetUnfolderBase]: 307/522 cut-off events. [2025-04-13 21:08:22,717 INFO L117 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-04-13 21:08:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 522 events. 307/522 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1988 event pairs, 26 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 1338. Up to 153 conditions per place. [2025-04-13 21:08:22,721 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 88 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2025-04-13 21:08:22,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 105 transitions, 529 flow [2025-04-13 21:08:22,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:08:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:08:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2025-04-13 21:08:22,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 21:08:22,723 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 93 flow. Second operand 13 states and 143 transitions. [2025-04-13 21:08:22,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 105 transitions, 529 flow [2025-04-13 21:08:22,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 105 transitions, 515 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:22,730 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 216 flow [2025-04-13 21:08:22,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=216, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-04-13 21:08:22,730 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 21 predicate places. [2025-04-13 21:08:22,730 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 216 flow [2025-04-13 21:08:22,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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 21:08:22,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:22,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:22,738 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 21:08:22,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:22,932 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:22,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1962707443, now seen corresponding path program 1 times [2025-04-13 21:08:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:22,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153042681] [2025-04-13 21:08:22,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:22,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:08:22,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:08:22,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:22,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:23,012 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 21:08:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:23,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153042681] [2025-04-13 21:08:23,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153042681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:23,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:23,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542031490] [2025-04-13 21:08:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:23,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:23,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:23,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:23,019 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:23,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 21:08:23,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:23,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:23,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:23,179 INFO L116 PetriNetUnfolderBase]: 363/616 cut-off events. [2025-04-13 21:08:23,180 INFO L117 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2025-04-13 21:08:23,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 616 events. 363/616 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2397 event pairs, 93 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 1986. Up to 245 conditions per place. [2025-04-13 21:08:23,184 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 66 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2025-04-13 21:08:23,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 730 flow [2025-04-13 21:08:23,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-13 21:08:23,185 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-04-13 21:08:23,185 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 216 flow. Second operand 7 states and 72 transitions. [2025-04-13 21:08:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 730 flow [2025-04-13 21:08:23,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 610 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-04-13 21:08:23,194 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 239 flow [2025-04-13 21:08:23,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-13 21:08:23,194 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2025-04-13 21:08:23,194 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 239 flow [2025-04-13 21:08:23,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 21:08:23,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:23,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:23,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:08:23,195 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:23,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash -714388406, now seen corresponding path program 1 times [2025-04-13 21:08:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:23,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705936175] [2025-04-13 21:08:23,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:23,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:08:23,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:08:23,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:23,270 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 21:08:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:23,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705936175] [2025-04-13 21:08:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705936175] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:23,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321122098] [2025-04-13 21:08:23,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:23,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:23,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:23,273 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 21:08:23,275 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 21:08:23,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:08:23,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:08:23,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:23,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:23,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:08:23,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:23,362 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 21:08:23,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:23,408 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 21:08:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321122098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:23,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 21:08:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904070564] [2025-04-13 21:08:23,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:23,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:08:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:23,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:08:23,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:08:23,421 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:23,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 239 flow. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 21:08:23,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:23,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:23,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:23,731 INFO L116 PetriNetUnfolderBase]: 531/898 cut-off events. [2025-04-13 21:08:23,731 INFO L117 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-04-13 21:08:23,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 898 events. 531/898 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3784 event pairs, 93 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 2098. Up to 258 conditions per place. [2025-04-13 21:08:23,738 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 129 selfloop transitions, 22 changer transitions 0/151 dead transitions. [2025-04-13 21:08:23,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 151 transitions, 1314 flow [2025-04-13 21:08:23,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:08:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:08:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 140 transitions. [2025-04-13 21:08:23,742 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48951048951048953 [2025-04-13 21:08:23,742 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 239 flow. Second operand 13 states and 140 transitions. [2025-04-13 21:08:23,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 151 transitions, 1314 flow [2025-04-13 21:08:23,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 151 transitions, 1295 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:23,754 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 376 flow [2025-04-13 21:08:23,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=376, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2025-04-13 21:08:23,755 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 40 predicate places. [2025-04-13 21:08:23,755 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 376 flow [2025-04-13 21:08:23,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 21:08:23,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:23,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:23,762 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 21:08:23,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 21:08:23,956 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:23,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2045870232, now seen corresponding path program 1 times [2025-04-13 21:08:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:23,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749675200] [2025-04-13 21:08:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:23,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:23,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:23,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:23,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:24,028 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 21:08:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:24,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749675200] [2025-04-13 21:08:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749675200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:24,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:24,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671718069] [2025-04-13 21:08:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:24,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:24,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:24,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:24,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:24,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 21:08:24,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:24,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:24,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:24,180 INFO L116 PetriNetUnfolderBase]: 555/938 cut-off events. [2025-04-13 21:08:24,181 INFO L117 PetriNetUnfolderBase]: For 3881/3881 co-relation queries the response was YES. [2025-04-13 21:08:24,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4497 conditions, 938 events. 555/938 cut-off events. For 3881/3881 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3995 event pairs, 121 based on Foata normal form. 16/876 useless extension candidates. Maximal degree in co-relation 2951. Up to 421 conditions per place. [2025-04-13 21:08:24,190 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 62 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2025-04-13 21:08:24,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 791 flow [2025-04-13 21:08:24,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:08:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:08:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 21:08:24,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-04-13 21:08:24,191 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 376 flow. Second operand 6 states and 58 transitions. [2025-04-13 21:08:24,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 791 flow [2025-04-13 21:08:24,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 713 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-04-13 21:08:24,207 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 366 flow [2025-04-13 21:08:24,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-04-13 21:08:24,208 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 41 predicate places. [2025-04-13 21:08:24,208 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 366 flow [2025-04-13 21:08:24,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 21:08:24,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:24,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:24,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:08:24,208 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:24,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1708760850, now seen corresponding path program 1 times [2025-04-13 21:08:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:24,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394989410] [2025-04-13 21:08:24,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:24,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:08:24,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:24,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:24,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:24,283 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 21:08:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:24,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394989410] [2025-04-13 21:08:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394989410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:24,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500675932] [2025-04-13 21:08:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:24,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:08:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:24,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:08:24,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:24,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:24,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 21:08:24,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:24,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:24,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:24,430 INFO L116 PetriNetUnfolderBase]: 580/980 cut-off events. [2025-04-13 21:08:24,431 INFO L117 PetriNetUnfolderBase]: For 4132/4132 co-relation queries the response was YES. [2025-04-13 21:08:24,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 980 events. 580/980 cut-off events. For 4132/4132 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4296 event pairs, 117 based on Foata normal form. 17/917 useless extension candidates. Maximal degree in co-relation 4266. Up to 457 conditions per place. [2025-04-13 21:08:24,438 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 67 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-04-13 21:08:24,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 795 flow [2025-04-13 21:08:24,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:08:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:08:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-04-13 21:08:24,440 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2025-04-13 21:08:24,440 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 366 flow. Second operand 6 states and 62 transitions. [2025-04-13 21:08:24,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 795 flow [2025-04-13 21:08:24,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 765 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:24,452 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 387 flow [2025-04-13 21:08:24,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2025-04-13 21:08:24,453 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 44 predicate places. [2025-04-13 21:08:24,453 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 387 flow [2025-04-13 21:08:24,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 21:08:24,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:24,454 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:24,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:08:24,454 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:24,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash 635941566, now seen corresponding path program 2 times [2025-04-13 21:08:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:24,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976471881] [2025-04-13 21:08:24,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:24,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 21:08:24,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:24,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:24,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:24,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976471881] [2025-04-13 21:08:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976471881] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:24,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699294778] [2025-04-13 21:08:24,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:24,562 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 21:08:24,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:08:24,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 21:08:24,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:08:24,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:24,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:24,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:24,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:24,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699294778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:24,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 21:08:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780564454] [2025-04-13 21:08:24,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:24,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:08:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:24,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:08:24,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:08:24,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:24,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 387 flow. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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 21:08:24,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:24,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:24,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:25,388 INFO L116 PetriNetUnfolderBase]: 934/1574 cut-off events. [2025-04-13 21:08:25,388 INFO L117 PetriNetUnfolderBase]: For 14126/14126 co-relation queries the response was YES. [2025-04-13 21:08:25,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7357 conditions, 1574 events. 934/1574 cut-off events. For 14126/14126 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7102 event pairs, 100 based on Foata normal form. 240/1710 useless extension candidates. Maximal degree in co-relation 7066. Up to 391 conditions per place. [2025-04-13 21:08:25,399 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 270 selfloop transitions, 40 changer transitions 0/310 dead transitions. [2025-04-13 21:08:25,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 310 transitions, 3026 flow [2025-04-13 21:08:25,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 21:08:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 21:08:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 275 transitions. [2025-04-13 21:08:25,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 21:08:25,401 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 387 flow. Second operand 25 states and 275 transitions. [2025-04-13 21:08:25,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 310 transitions, 3026 flow [2025-04-13 21:08:25,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 310 transitions, 2895 flow, removed 55 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:25,427 INFO L231 Difference]: Finished difference. Result has 100 places, 68 transitions, 698 flow [2025-04-13 21:08:25,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=698, PETRI_PLACES=100, PETRI_TRANSITIONS=68} [2025-04-13 21:08:25,428 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 77 predicate places. [2025-04-13 21:08:25,428 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 68 transitions, 698 flow [2025-04-13 21:08:25,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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 21:08:25,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:25,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:25,437 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 21:08:25,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:25,634 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:25,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash 460579845, now seen corresponding path program 1 times [2025-04-13 21:08:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:25,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188910631] [2025-04-13 21:08:25,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:25,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:25,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:25,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:25,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:25,698 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 21:08:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:25,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188910631] [2025-04-13 21:08:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188910631] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:25,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22557604] [2025-04-13 21:08:25,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:25,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:25,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:25,703 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 21:08:25,708 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 21:08:25,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:25,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:25,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:25,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:08:25,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:25,790 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 21:08:25,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:25,836 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 21:08:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22557604] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:25,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 21:08:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63204711] [2025-04-13 21:08:25,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:25,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:08:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:25,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:08:25,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:08:25,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:25,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 68 transitions, 698 flow. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 21:08:25,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:25,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:25,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:26,111 INFO L116 PetriNetUnfolderBase]: 1006/1694 cut-off events. [2025-04-13 21:08:26,111 INFO L117 PetriNetUnfolderBase]: For 22258/22258 co-relation queries the response was YES. [2025-04-13 21:08:26,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9564 conditions, 1694 events. 1006/1694 cut-off events. For 22258/22258 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7846 event pairs, 202 based on Foata normal form. 48/1632 useless extension candidates. Maximal degree in co-relation 6822. Up to 746 conditions per place. [2025-04-13 21:08:26,124 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 108 selfloop transitions, 24 changer transitions 0/132 dead transitions. [2025-04-13 21:08:26,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 1648 flow [2025-04-13 21:08:26,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:08:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 21:08:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-04-13 21:08:26,125 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2025-04-13 21:08:26,125 INFO L175 Difference]: Start difference. First operand has 100 places, 68 transitions, 698 flow. Second operand 9 states and 86 transitions. [2025-04-13 21:08:26,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 1648 flow [2025-04-13 21:08:26,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 132 transitions, 1408 flow, removed 84 selfloop flow, removed 12 redundant places. [2025-04-13 21:08:26,183 INFO L231 Difference]: Finished difference. Result has 99 places, 71 transitions, 628 flow [2025-04-13 21:08:26,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=628, PETRI_PLACES=99, PETRI_TRANSITIONS=71} [2025-04-13 21:08:26,184 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 76 predicate places. [2025-04-13 21:08:26,184 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 71 transitions, 628 flow [2025-04-13 21:08:26,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 21:08:26,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:26,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:26,191 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 21:08:26,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:26,389 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:26,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1431978615, now seen corresponding path program 1 times [2025-04-13 21:08:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:26,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249028597] [2025-04-13 21:08:26,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:26,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:26,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:26,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:26,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:26,439 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 21:08:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:26,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249028597] [2025-04-13 21:08:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249028597] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:26,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740543776] [2025-04-13 21:08:26,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:26,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:26,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:26,441 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 21:08:26,443 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 21:08:26,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:26,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:26,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:26,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:26,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:08:26,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:26,518 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 21:08:26,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:26,561 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 21:08:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740543776] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:26,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 21:08:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945201175] [2025-04-13 21:08:26,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:26,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:08:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:26,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:08:26,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:08:26,572 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:26,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 71 transitions, 628 flow. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 21:08:26,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:26,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:26,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:26,905 INFO L116 PetriNetUnfolderBase]: 1135/1910 cut-off events. [2025-04-13 21:08:26,905 INFO L117 PetriNetUnfolderBase]: For 19309/19309 co-relation queries the response was YES. [2025-04-13 21:08:26,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9790 conditions, 1910 events. 1135/1910 cut-off events. For 19309/19309 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9101 event pairs, 114 based on Foata normal form. 87/1881 useless extension candidates. Maximal degree in co-relation 9450. Up to 819 conditions per place. [2025-04-13 21:08:26,918 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 136 selfloop transitions, 24 changer transitions 0/160 dead transitions. [2025-04-13 21:08:26,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 160 transitions, 1865 flow [2025-04-13 21:08:26,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:08:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 21:08:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2025-04-13 21:08:26,919 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2025-04-13 21:08:26,919 INFO L175 Difference]: Start difference. First operand has 99 places, 71 transitions, 628 flow. Second operand 9 states and 93 transitions. [2025-04-13 21:08:26,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 160 transitions, 1865 flow [2025-04-13 21:08:26,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 160 transitions, 1787 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-13 21:08:26,966 INFO L231 Difference]: Finished difference. Result has 105 places, 74 transitions, 654 flow [2025-04-13 21:08:26,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=654, PETRI_PLACES=105, PETRI_TRANSITIONS=74} [2025-04-13 21:08:26,966 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 82 predicate places. [2025-04-13 21:08:26,966 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 74 transitions, 654 flow [2025-04-13 21:08:26,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 21:08:26,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:26,967 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:26,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:08:27,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:27,167 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:27,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -781869747, now seen corresponding path program 2 times [2025-04-13 21:08:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:27,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505633111] [2025-04-13 21:08:27,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:27,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 21:08:27,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:08:27,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:27,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:27,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505633111] [2025-04-13 21:08:27,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505633111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:27,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769863232] [2025-04-13 21:08:27,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:27,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:27,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:27,250 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 21:08:27,251 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 21:08:27,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 21:08:27,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:08:27,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:27,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:27,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:27,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:27,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769863232] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:27,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 21:08:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501456202] [2025-04-13 21:08:27,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:27,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:08:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:27,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:08:27,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:08:27,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:27,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 74 transitions, 654 flow. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:27,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:27,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:27,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:28,245 INFO L116 PetriNetUnfolderBase]: 1759/2954 cut-off events. [2025-04-13 21:08:28,246 INFO L117 PetriNetUnfolderBase]: For 55614/55614 co-relation queries the response was YES. [2025-04-13 21:08:28,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15545 conditions, 2954 events. 1759/2954 cut-off events. For 55614/55614 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14792 event pairs, 279 based on Foata normal form. 420/3234 useless extension candidates. Maximal degree in co-relation 14862. Up to 767 conditions per place. [2025-04-13 21:08:28,273 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 441 selfloop transitions, 46 changer transitions 0/487 dead transitions. [2025-04-13 21:08:28,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 487 transitions, 5558 flow [2025-04-13 21:08:28,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 21:08:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 21:08:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 272 transitions. [2025-04-13 21:08:28,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49454545454545457 [2025-04-13 21:08:28,277 INFO L175 Difference]: Start difference. First operand has 105 places, 74 transitions, 654 flow. Second operand 25 states and 272 transitions. [2025-04-13 21:08:28,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 487 transitions, 5558 flow [2025-04-13 21:08:28,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 487 transitions, 5448 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-13 21:08:28,394 INFO L231 Difference]: Finished difference. Result has 136 places, 92 transitions, 942 flow [2025-04-13 21:08:28,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=942, PETRI_PLACES=136, PETRI_TRANSITIONS=92} [2025-04-13 21:08:28,395 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 113 predicate places. [2025-04-13 21:08:28,395 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 92 transitions, 942 flow [2025-04-13 21:08:28,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:28,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:28,395 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:28,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 21:08:28,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:28,596 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:28,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:28,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1835394004, now seen corresponding path program 2 times [2025-04-13 21:08:28,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:28,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627732292] [2025-04-13 21:08:28,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:28,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:28,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:08:28,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:08:28,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:28,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:28,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627732292] [2025-04-13 21:08:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627732292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:28,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582379491] [2025-04-13 21:08:28,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:28,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:28,690 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 21:08:28,692 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 21:08:28,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:08:28,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:08:28,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:28,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:28,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:28,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:28,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582379491] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:28,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:28,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 21:08:28,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13870578] [2025-04-13 21:08:28,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:28,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:08:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:28,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:08:28,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:08:28,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:28,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 92 transitions, 942 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 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 21:08:28,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:28,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:28,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:29,522 INFO L116 PetriNetUnfolderBase]: 2011/3374 cut-off events. [2025-04-13 21:08:29,522 INFO L117 PetriNetUnfolderBase]: For 88268/88268 co-relation queries the response was YES. [2025-04-13 21:08:29,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20780 conditions, 3374 events. 2011/3374 cut-off events. For 88268/88268 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17484 event pairs, 234 based on Foata normal form. 168/3390 useless extension candidates. Maximal degree in co-relation 15032. Up to 1406 conditions per place. [2025-04-13 21:08:29,550 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 237 selfloop transitions, 36 changer transitions 0/273 dead transitions. [2025-04-13 21:08:29,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 273 transitions, 4100 flow [2025-04-13 21:08:29,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:08:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:08:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 140 transitions. [2025-04-13 21:08:29,551 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-13 21:08:29,551 INFO L175 Difference]: Start difference. First operand has 136 places, 92 transitions, 942 flow. Second operand 15 states and 140 transitions. [2025-04-13 21:08:29,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 273 transitions, 4100 flow [2025-04-13 21:08:29,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 273 transitions, 3308 flow, removed 312 selfloop flow, removed 12 redundant places. [2025-04-13 21:08:29,712 INFO L231 Difference]: Finished difference. Result has 144 places, 98 transitions, 932 flow [2025-04-13 21:08:29,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=932, PETRI_PLACES=144, PETRI_TRANSITIONS=98} [2025-04-13 21:08:29,713 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 121 predicate places. [2025-04-13 21:08:29,713 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 98 transitions, 932 flow [2025-04-13 21:08:29,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 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 21:08:29,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:29,713 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:29,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 21:08:29,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:29,914 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:29,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1835413422, now seen corresponding path program 2 times [2025-04-13 21:08:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:29,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465797647] [2025-04-13 21:08:29,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:29,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:08:29,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:08:29,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:29,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:30,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:30,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465797647] [2025-04-13 21:08:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465797647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:30,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36380310] [2025-04-13 21:08:30,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:08:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:30,035 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 21:08:30,037 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 21:08:30,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:08:30,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:08:30,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:30,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:30,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:30,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:30,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:30,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36380310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:30,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 21:08:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101834314] [2025-04-13 21:08:30,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:30,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:08:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:30,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:08:30,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:08:30,246 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:30,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 98 transitions, 932 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 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 21:08:30,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:30,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:30,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:31,004 INFO L116 PetriNetUnfolderBase]: 2269/3806 cut-off events. [2025-04-13 21:08:31,005 INFO L117 PetriNetUnfolderBase]: For 104823/104823 co-relation queries the response was YES. [2025-04-13 21:08:31,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21985 conditions, 3806 events. 2269/3806 cut-off events. For 104823/104823 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20218 event pairs, 275 based on Foata normal form. 174/3816 useless extension candidates. Maximal degree in co-relation 21600. Up to 1821 conditions per place. [2025-04-13 21:08:31,029 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 256 selfloop transitions, 36 changer transitions 0/292 dead transitions. [2025-04-13 21:08:31,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 292 transitions, 3837 flow [2025-04-13 21:08:31,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:08:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:08:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 153 transitions. [2025-04-13 21:08:31,031 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2025-04-13 21:08:31,031 INFO L175 Difference]: Start difference. First operand has 144 places, 98 transitions, 932 flow. Second operand 15 states and 153 transitions. [2025-04-13 21:08:31,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 292 transitions, 3837 flow [2025-04-13 21:08:31,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 292 transitions, 3697 flow, removed 37 selfloop flow, removed 8 redundant places. [2025-04-13 21:08:31,241 INFO L231 Difference]: Finished difference. Result has 156 places, 104 transitions, 980 flow [2025-04-13 21:08:31,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=980, PETRI_PLACES=156, PETRI_TRANSITIONS=104} [2025-04-13 21:08:31,241 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 133 predicate places. [2025-04-13 21:08:31,242 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 104 transitions, 980 flow [2025-04-13 21:08:31,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 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 21:08:31,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:31,242 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:31,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 21:08:31,442 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,SelfDestructingSolverStorable11 [2025-04-13 21:08:31,442 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:31,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:31,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1825920670, now seen corresponding path program 3 times [2025-04-13 21:08:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:31,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815727712] [2025-04-13 21:08:31,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:31,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-13 21:08:31,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-13 21:08:31,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:08:31,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 21:08:31,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:31,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815727712] [2025-04-13 21:08:31,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815727712] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:31,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685174746] [2025-04-13 21:08:31,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:31,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:31,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:31,516 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 21:08:31,518 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 21:08:31,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-13 21:08:31,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-13 21:08:31,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:08:31,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:31,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:31,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 21:08:31,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:08:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685174746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:08:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 21:08:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277880920] [2025-04-13 21:08:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:31,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:08:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:08:31,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:31,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:31,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 104 transitions, 980 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 21:08:31,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:31,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:31,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:32,080 INFO L116 PetriNetUnfolderBase]: 2287/3840 cut-off events. [2025-04-13 21:08:32,080 INFO L117 PetriNetUnfolderBase]: For 94759/94759 co-relation queries the response was YES. [2025-04-13 21:08:32,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21857 conditions, 3840 events. 2287/3840 cut-off events. For 94759/94759 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20320 event pairs, 610 based on Foata normal form. 0/3727 useless extension candidates. Maximal degree in co-relation 21148. Up to 1557 conditions per place. [2025-04-13 21:08:32,115 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 170 selfloop transitions, 27 changer transitions 5/202 dead transitions. [2025-04-13 21:08:32,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 202 transitions, 2661 flow [2025-04-13 21:08:32,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-13 21:08:32,116 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2025-04-13 21:08:32,116 INFO L175 Difference]: Start difference. First operand has 156 places, 104 transitions, 980 flow. Second operand 7 states and 80 transitions. [2025-04-13 21:08:32,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 202 transitions, 2661 flow [2025-04-13 21:08:32,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 202 transitions, 2357 flow, removed 111 selfloop flow, removed 8 redundant places. [2025-04-13 21:08:32,344 INFO L231 Difference]: Finished difference. Result has 156 places, 105 transitions, 936 flow [2025-04-13 21:08:32,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=936, PETRI_PLACES=156, PETRI_TRANSITIONS=105} [2025-04-13 21:08:32,345 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 133 predicate places. [2025-04-13 21:08:32,345 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 105 transitions, 936 flow [2025-04-13 21:08:32,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 21:08:32,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:32,345 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:32,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 21:08:32,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 21:08:32,550 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:32,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash -806663123, now seen corresponding path program 3 times [2025-04-13 21:08:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:32,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408270849] [2025-04-13 21:08:32,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:32,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 21:08:32,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 21:08:32,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:08:32,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 21:08:32,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:32,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408270849] [2025-04-13 21:08:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408270849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:32,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974711689] [2025-04-13 21:08:32,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:32,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:32,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:32,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:32,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 21:08:32,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 21:08:32,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 21:08:32,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:08:32,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:32,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:08:32,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 21:08:32,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:08:32,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974711689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:32,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:08:32,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 21:08:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111497064] [2025-04-13 21:08:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:32,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:08:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:32,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:08:32,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:08:32,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:32,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 105 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 21:08:32,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:32,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:32,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:33,097 INFO L116 PetriNetUnfolderBase]: 2281/3830 cut-off events. [2025-04-13 21:08:33,097 INFO L117 PetriNetUnfolderBase]: For 117471/117471 co-relation queries the response was YES. [2025-04-13 21:08:33,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20018 conditions, 3830 events. 2281/3830 cut-off events. For 117471/117471 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20234 event pairs, 593 based on Foata normal form. 0/3803 useless extension candidates. Maximal degree in co-relation 14932. Up to 1620 conditions per place. [2025-04-13 21:08:33,121 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 89 selfloop transitions, 5 changer transitions 103/197 dead transitions. [2025-04-13 21:08:33,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 197 transitions, 2268 flow [2025-04-13 21:08:33,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:08:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:08:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-13 21:08:33,122 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-04-13 21:08:33,122 INFO L175 Difference]: Start difference. First operand has 156 places, 105 transitions, 936 flow. Second operand 7 states and 74 transitions. [2025-04-13 21:08:33,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 197 transitions, 2268 flow [2025-04-13 21:08:33,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 197 transitions, 2243 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:08:33,319 INFO L231 Difference]: Finished difference. Result has 161 places, 64 transitions, 555 flow [2025-04-13 21:08:33,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=555, PETRI_PLACES=161, PETRI_TRANSITIONS=64} [2025-04-13 21:08:33,319 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 138 predicate places. [2025-04-13 21:08:33,319 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 64 transitions, 555 flow [2025-04-13 21:08:33,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 21:08:33,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:33,320 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:33,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 21:08:33,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 21:08:33,523 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:33,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash -969507832, now seen corresponding path program 3 times [2025-04-13 21:08:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:33,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563091094] [2025-04-13 21:08:33,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:33,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:33,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 21:08:33,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:08:33,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:08:33,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:33,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563091094] [2025-04-13 21:08:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563091094] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:33,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877881242] [2025-04-13 21:08:33,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:33,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:33,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:33,696 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:33,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 21:08:33,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 21:08:33,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:08:33,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:08:33,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:33,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:08:33,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:33,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:34,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877881242] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:34,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:34,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-13 21:08:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235492203] [2025-04-13 21:08:34,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:34,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 21:08:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:34,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 21:08:34,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 21:08:34,120 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:34,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 64 transitions, 555 flow. Second operand has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 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 21:08:34,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:34,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:34,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:34,869 INFO L116 PetriNetUnfolderBase]: 1739/2951 cut-off events. [2025-04-13 21:08:34,869 INFO L117 PetriNetUnfolderBase]: For 335063/335063 co-relation queries the response was YES. [2025-04-13 21:08:34,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16074 conditions, 2951 events. 1739/2951 cut-off events. For 335063/335063 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13388 event pairs, 451 based on Foata normal form. 624/3575 useless extension candidates. Maximal degree in co-relation 14949. Up to 1017 conditions per place. [2025-04-13 21:08:34,886 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 361 selfloop transitions, 28 changer transitions 17/406 dead transitions. [2025-04-13 21:08:34,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 406 transitions, 4487 flow [2025-04-13 21:08:34,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 21:08:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 21:08:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 223 transitions. [2025-04-13 21:08:34,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37542087542087543 [2025-04-13 21:08:34,888 INFO L175 Difference]: Start difference. First operand has 161 places, 64 transitions, 555 flow. Second operand 27 states and 223 transitions. [2025-04-13 21:08:34,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 406 transitions, 4487 flow [2025-04-13 21:08:34,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 406 transitions, 3776 flow, removed 331 selfloop flow, removed 24 redundant places. [2025-04-13 21:08:34,971 INFO L231 Difference]: Finished difference. Result has 152 places, 76 transitions, 708 flow [2025-04-13 21:08:34,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=708, PETRI_PLACES=152, PETRI_TRANSITIONS=76} [2025-04-13 21:08:34,972 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 129 predicate places. [2025-04-13 21:08:34,972 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 76 transitions, 708 flow [2025-04-13 21:08:34,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 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 21:08:34,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:34,972 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:34,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 21:08:35,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 21:08:35,172 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:35,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash -990719538, now seen corresponding path program 3 times [2025-04-13 21:08:35,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:35,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771440085] [2025-04-13 21:08:35,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:35,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 21:08:35,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:08:35,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:08:35,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:35,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:35,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771440085] [2025-04-13 21:08:35,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771440085] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:35,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059031284] [2025-04-13 21:08:35,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:08:35,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:35,324 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:35,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 21:08:35,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 21:08:35,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:08:35,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:08:35,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:35,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:08:35,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:35,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:35,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059031284] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:35,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:35,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-13 21:08:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562368240] [2025-04-13 21:08:35,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:35,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 21:08:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:35,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 21:08:35,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 21:08:35,696 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:35,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 76 transitions, 708 flow. Second operand has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 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 21:08:35,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:35,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:35,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:36,560 INFO L116 PetriNetUnfolderBase]: 2219/3755 cut-off events. [2025-04-13 21:08:36,560 INFO L117 PetriNetUnfolderBase]: For 185053/185053 co-relation queries the response was YES. [2025-04-13 21:08:36,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19566 conditions, 3755 events. 2219/3755 cut-off events. For 185053/185053 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17693 event pairs, 701 based on Foata normal form. 648/4403 useless extension candidates. Maximal degree in co-relation 19245. Up to 1797 conditions per place. [2025-04-13 21:08:36,587 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 399 selfloop transitions, 28 changer transitions 16/443 dead transitions. [2025-04-13 21:08:36,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 443 transitions, 4733 flow [2025-04-13 21:08:36,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 21:08:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 21:08:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 248 transitions. [2025-04-13 21:08:36,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4175084175084175 [2025-04-13 21:08:36,588 INFO L175 Difference]: Start difference. First operand has 152 places, 76 transitions, 708 flow. Second operand 27 states and 248 transitions. [2025-04-13 21:08:36,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 443 transitions, 4733 flow [2025-04-13 21:08:36,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 443 transitions, 4573 flow, removed 61 selfloop flow, removed 14 redundant places. [2025-04-13 21:08:36,709 INFO L231 Difference]: Finished difference. Result has 176 places, 88 transitions, 804 flow [2025-04-13 21:08:36,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=804, PETRI_PLACES=176, PETRI_TRANSITIONS=88} [2025-04-13 21:08:36,710 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 153 predicate places. [2025-04-13 21:08:36,710 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 88 transitions, 804 flow [2025-04-13 21:08:36,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 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 21:08:36,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:36,710 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:36,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 21:08:36,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 21:08:36,911 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:36,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2004388724, now seen corresponding path program 4 times [2025-04-13 21:08:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:36,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622872739] [2025-04-13 21:08:36,912 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:08:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:36,917 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 21:08:36,926 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 21:08:36,926 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:08:36,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:37,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:37,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622872739] [2025-04-13 21:08:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622872739] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:37,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073040708] [2025-04-13 21:08:37,286 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:08:37,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:37,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:37,291 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:37,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 21:08:37,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 21:08:37,336 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 21:08:37,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:08:37,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:37,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 21:08:37,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:37,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:38,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073040708] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:38,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:38,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-04-13 21:08:38,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983514075] [2025-04-13 21:08:38,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:38,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-13 21:08:38,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:38,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-13 21:08:38,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3605, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 21:08:38,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:38,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 88 transitions, 804 flow. Second operand has 77 states, 77 states have (on average 3.142857142857143) internal successors, (242), 77 states have internal predecessors, (242), 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 21:08:38,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:38,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:38,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:40,481 INFO L116 PetriNetUnfolderBase]: 3155/5315 cut-off events. [2025-04-13 21:08:40,481 INFO L117 PetriNetUnfolderBase]: For 704539/704539 co-relation queries the response was YES. [2025-04-13 21:08:40,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27885 conditions, 5315 events. 3155/5315 cut-off events. For 704539/704539 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 24241 event pairs, 751 based on Foata normal form. 1248/6563 useless extension candidates. Maximal degree in co-relation 27232. Up to 1821 conditions per place. [2025-04-13 21:08:40,513 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 709 selfloop transitions, 52 changer transitions 17/778 dead transitions. [2025-04-13 21:08:40,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 778 transitions, 8544 flow [2025-04-13 21:08:40,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 21:08:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-13 21:08:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 415 transitions. [2025-04-13 21:08:40,515 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3698752228163993 [2025-04-13 21:08:40,515 INFO L175 Difference]: Start difference. First operand has 176 places, 88 transitions, 804 flow. Second operand 51 states and 415 transitions. [2025-04-13 21:08:40,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 778 transitions, 8544 flow [2025-04-13 21:08:40,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 778 transitions, 8384 flow, removed 61 selfloop flow, removed 14 redundant places. [2025-04-13 21:08:40,691 INFO L231 Difference]: Finished difference. Result has 236 places, 112 transitions, 1140 flow [2025-04-13 21:08:40,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1140, PETRI_PLACES=236, PETRI_TRANSITIONS=112} [2025-04-13 21:08:40,692 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 213 predicate places. [2025-04-13 21:08:40,692 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 112 transitions, 1140 flow [2025-04-13 21:08:40,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.142857142857143) internal successors, (242), 77 states have internal predecessors, (242), 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 21:08:40,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:40,692 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:40,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 21:08:40,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 21:08:40,893 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:40,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 51789778, now seen corresponding path program 4 times [2025-04-13 21:08:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:40,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964059975] [2025-04-13 21:08:40,894 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:08:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:40,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 21:08:40,906 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 21:08:40,906 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:08:40,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:41,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:41,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964059975] [2025-04-13 21:08:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964059975] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:41,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795248852] [2025-04-13 21:08:41,410 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:08:41,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:41,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:41,413 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:41,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 21:08:41,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 21:08:41,470 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 21:08:41,470 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:08:41,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:41,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 21:08:41,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:41,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795248852] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:42,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 76 [2025-04-13 21:08:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886457276] [2025-04-13 21:08:42,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:42,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-04-13 21:08:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:42,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-04-13 21:08:42,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2253, Invalid=3753, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 21:08:42,580 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:42,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 112 transitions, 1140 flow. Second operand has 78 states, 78 states have (on average 3.1666666666666665) internal successors, (247), 78 states have internal predecessors, (247), 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 21:08:42,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:42,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:42,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:45,157 INFO L116 PetriNetUnfolderBase]: 4115/6923 cut-off events. [2025-04-13 21:08:45,157 INFO L117 PetriNetUnfolderBase]: For 916227/916227 co-relation queries the response was YES. [2025-04-13 21:08:45,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39690 conditions, 6923 events. 4115/6923 cut-off events. For 916227/916227 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 33053 event pairs, 1277 based on Foata normal form. 1296/8219 useless extension candidates. Maximal degree in co-relation 39285. Up to 3357 conditions per place. [2025-04-13 21:08:45,209 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 783 selfloop transitions, 52 changer transitions 16/851 dead transitions. [2025-04-13 21:08:45,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 851 transitions, 11429 flow [2025-04-13 21:08:45,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 21:08:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-13 21:08:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 464 transitions. [2025-04-13 21:08:45,211 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41354723707664887 [2025-04-13 21:08:45,211 INFO L175 Difference]: Start difference. First operand has 236 places, 112 transitions, 1140 flow. Second operand 51 states and 464 transitions. [2025-04-13 21:08:45,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 851 transitions, 11429 flow [2025-04-13 21:08:45,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 851 transitions, 11125 flow, removed 121 selfloop flow, removed 26 redundant places. [2025-04-13 21:08:45,625 INFO L231 Difference]: Finished difference. Result has 284 places, 136 transitions, 1332 flow [2025-04-13 21:08:45,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1332, PETRI_PLACES=284, PETRI_TRANSITIONS=136} [2025-04-13 21:08:45,626 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 261 predicate places. [2025-04-13 21:08:45,626 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 136 transitions, 1332 flow [2025-04-13 21:08:45,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.1666666666666665) internal successors, (247), 78 states have internal predecessors, (247), 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 21:08:45,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:45,626 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:45,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 21:08:45,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:45,827 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:45,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash 267553292, now seen corresponding path program 5 times [2025-04-13 21:08:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:45,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562080663] [2025-04-13 21:08:45,828 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:08:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:45,835 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 21:08:45,853 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 21:08:45,853 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 21:08:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:46,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562080663] [2025-04-13 21:08:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562080663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:46,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526290527] [2025-04-13 21:08:46,953 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:08:46,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:46,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:46,955 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:46,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 21:08:46,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 21:08:47,010 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 21:08:47,010 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 21:08:47,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:47,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 21:08:47,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:48,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526290527] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:50,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:50,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-13 21:08:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382528227] [2025-04-13 21:08:50,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:50,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-13 21:08:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:50,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-13 21:08:50,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-13 21:08:50,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:08:50,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 136 transitions, 1332 flow. Second operand has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 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 21:08:50,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:50,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:08:50,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:57,067 INFO L116 PetriNetUnfolderBase]: 5987/10043 cut-off events. [2025-04-13 21:08:57,067 INFO L117 PetriNetUnfolderBase]: For 4299508/4299508 co-relation queries the response was YES. [2025-04-13 21:08:57,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59781 conditions, 10043 events. 5987/10043 cut-off events. For 4299508/4299508 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 45877 event pairs, 1351 based on Foata normal form. 2496/12539 useless extension candidates. Maximal degree in co-relation 45538. Up to 3429 conditions per place. [2025-04-13 21:08:57,159 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1405 selfloop transitions, 100 changer transitions 17/1522 dead transitions. [2025-04-13 21:08:57,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1522 transitions, 21360 flow [2025-04-13 21:08:57,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 21:08:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-13 21:08:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 799 transitions. [2025-04-13 21:08:57,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36685032139577595 [2025-04-13 21:08:57,161 INFO L175 Difference]: Start difference. First operand has 284 places, 136 transitions, 1332 flow. Second operand 99 states and 799 transitions. [2025-04-13 21:08:57,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1522 transitions, 21360 flow [2025-04-13 21:08:57,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 1522 transitions, 21056 flow, removed 121 selfloop flow, removed 26 redundant places. [2025-04-13 21:08:57,840 INFO L231 Difference]: Finished difference. Result has 404 places, 184 transitions, 2004 flow [2025-04-13 21:08:57,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=2004, PETRI_PLACES=404, PETRI_TRANSITIONS=184} [2025-04-13 21:08:57,840 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 381 predicate places. [2025-04-13 21:08:57,841 INFO L485 AbstractCegarLoop]: Abstraction has has 404 places, 184 transitions, 2004 flow [2025-04-13 21:08:57,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 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 21:08:57,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:57,841 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:57,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 21:08:58,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:58,042 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:08:58,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2138003826, now seen corresponding path program 5 times [2025-04-13 21:08:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:58,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209576232] [2025-04-13 21:08:58,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:08:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:58,047 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 21:08:58,063 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 21:08:58,063 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 21:08:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:59,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:59,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209576232] [2025-04-13 21:08:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209576232] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:59,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720065190] [2025-04-13 21:08:59,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:08:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:59,139 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:59,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 21:08:59,172 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 21:08:59,192 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 21:08:59,192 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 21:08:59,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:59,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 21:08:59,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:00,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720065190] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:02,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:02,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-13 21:09:02,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669664096] [2025-04-13 21:09:02,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:02,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-13 21:09:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:02,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-13 21:09:02,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-13 21:09:02,329 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:09:02,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 184 transitions, 2004 flow. Second operand has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 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 21:09:02,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:02,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:09:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:10,877 INFO L116 PetriNetUnfolderBase]: 7907/13259 cut-off events. [2025-04-13 21:09:10,877 INFO L117 PetriNetUnfolderBase]: For 5566335/5566335 co-relation queries the response was YES. [2025-04-13 21:09:10,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90306 conditions, 13259 events. 7907/13259 cut-off events. For 5566335/5566335 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 63790 event pairs, 2429 based on Foata normal form. 2592/15851 useless extension candidates. Maximal degree in co-relation 89733. Up to 6477 conditions per place. [2025-04-13 21:09:11,034 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1551 selfloop transitions, 100 changer transitions 16/1667 dead transitions. [2025-04-13 21:09:11,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 1667 transitions, 31733 flow [2025-04-13 21:09:11,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 21:09:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-13 21:09:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 896 transitions. [2025-04-13 21:09:11,036 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.411386593204775 [2025-04-13 21:09:11,036 INFO L175 Difference]: Start difference. First operand has 404 places, 184 transitions, 2004 flow. Second operand 99 states and 896 transitions. [2025-04-13 21:09:11,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 1667 transitions, 31733 flow [2025-04-13 21:09:12,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1667 transitions, 31141 flow, removed 241 selfloop flow, removed 50 redundant places. [2025-04-13 21:09:12,731 INFO L231 Difference]: Finished difference. Result has 500 places, 232 transitions, 2388 flow [2025-04-13 21:09:12,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=2388, PETRI_PLACES=500, PETRI_TRANSITIONS=232} [2025-04-13 21:09:12,731 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 477 predicate places. [2025-04-13 21:09:12,732 INFO L485 AbstractCegarLoop]: Abstraction has has 500 places, 232 transitions, 2388 flow [2025-04-13 21:09:12,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 3.0738255033557045) internal successors, (458), 149 states have internal predecessors, (458), 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 21:09:12,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:12,732 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:12,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 21:09:12,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:12,933 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:09:12,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash -928041716, now seen corresponding path program 6 times [2025-04-13 21:09:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:12,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156514599] [2025-04-13 21:09:12,934 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:12,940 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 21:09:12,971 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 21:09:12,971 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 21:09:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:16,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156514599] [2025-04-13 21:09:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156514599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:16,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826727766] [2025-04-13 21:09:16,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:16,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:16,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:16,565 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:09:16,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 21:09:16,609 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 21:09:16,660 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 21:09:16,660 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 21:09:16,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:16,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-13 21:09:16,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:19,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826727766] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:23,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 202 [2025-04-13 21:09:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816640548] [2025-04-13 21:09:23,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:23,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2025-04-13 21:09:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:23,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2025-04-13 21:09:23,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=26265, Unknown=0, NotChecked=0, Total=41412 [2025-04-13 21:09:23,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:09:23,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 232 transitions, 2388 flow. Second operand has 204 states, 204 states have (on average 3.0588235294117645) internal successors, (624), 204 states have internal predecessors, (624), 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 21:09:23,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:23,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:09:23,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:34,995 INFO L116 PetriNetUnfolderBase]: 8180/13714 cut-off events. [2025-04-13 21:09:34,995 INFO L117 PetriNetUnfolderBase]: For 4746782/4746782 co-relation queries the response was YES. [2025-04-13 21:09:35,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102301 conditions, 13714 events. 8180/13714 cut-off events. For 4746782/4746782 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 65843 event pairs, 2551 based on Foata normal form. 364/14078 useless extension candidates. Maximal degree in co-relation 70336. Up to 6645 conditions per place. [2025-04-13 21:09:35,220 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1551 selfloop transitions, 107 changer transitions 17/1675 dead transitions. [2025-04-13 21:09:35,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 1675 transitions, 33493 flow [2025-04-13 21:09:35,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-13 21:09:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2025-04-13 21:09:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 766 transitions. [2025-04-13 21:09:35,222 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32847341337907376 [2025-04-13 21:09:35,222 INFO L175 Difference]: Start difference. First operand has 500 places, 232 transitions, 2388 flow. Second operand 106 states and 766 transitions. [2025-04-13 21:09:35,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 1675 transitions, 33493 flow [2025-04-13 21:09:38,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1675 transitions, 32901 flow, removed 241 selfloop flow, removed 50 redundant places. [2025-04-13 21:09:38,125 INFO L231 Difference]: Finished difference. Result has 562 places, 239 transitions, 2130 flow [2025-04-13 21:09:38,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=2130, PETRI_PLACES=562, PETRI_TRANSITIONS=239} [2025-04-13 21:09:38,126 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 539 predicate places. [2025-04-13 21:09:38,126 INFO L485 AbstractCegarLoop]: Abstraction has has 562 places, 239 transitions, 2130 flow [2025-04-13 21:09:38,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 204 states have (on average 3.0588235294117645) internal successors, (624), 204 states have internal predecessors, (624), 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 21:09:38,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:38,127 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:38,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 21:09:38,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:38,327 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:09:38,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash 367908750, now seen corresponding path program 6 times [2025-04-13 21:09:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:38,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816731657] [2025-04-13 21:09:38,329 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:38,336 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 21:09:38,363 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 21:09:38,363 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 21:09:38,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:41,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816731657] [2025-04-13 21:09:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816731657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:41,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817380165] [2025-04-13 21:09:41,966 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:41,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:41,968 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:09:41,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 21:09:42,009 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 21:09:42,050 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 21:09:42,051 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 21:09:42,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:42,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-13 21:09:42,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:45,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817380165] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:48,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2025-04-13 21:09:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154965377] [2025-04-13 21:09:48,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:48,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2025-04-13 21:09:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:48,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2025-04-13 21:09:48,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14950, Invalid=26056, Unknown=0, NotChecked=0, Total=41006 [2025-04-13 21:09:48,456 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-13 21:09:48,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 239 transitions, 2130 flow. Second operand has 203 states, 203 states have (on average 3.0591133004926108) internal successors, (621), 203 states have internal predecessors, (621), 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 21:09:48,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:48,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-13 21:09:48,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:10:00,615 INFO L116 PetriNetUnfolderBase]: 8420/14116 cut-off events. [2025-04-13 21:10:00,615 INFO L117 PetriNetUnfolderBase]: For 4802731/4802731 co-relation queries the response was YES. [2025-04-13 21:10:00,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102131 conditions, 14116 events. 8420/14116 cut-off events. For 4802731/4802731 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 67945 event pairs, 2597 based on Foata normal form. 324/14440 useless extension candidates. Maximal degree in co-relation 101489. Up to 6932 conditions per place. [2025-04-13 21:10:00,896 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1648 selfloop transitions, 106 changer transitions 16/1770 dead transitions. [2025-04-13 21:10:00,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 1770 transitions, 34871 flow [2025-04-13 21:10:00,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-13 21:10:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-04-13 21:10:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 860 transitions. [2025-04-13 21:10:00,899 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3722943722943723 [2025-04-13 21:10:00,899 INFO L175 Difference]: Start difference. First operand has 562 places, 239 transitions, 2130 flow. Second operand 105 states and 860 transitions. [2025-04-13 21:10:00,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 1770 transitions, 34871 flow [2025-04-13 21:10:04,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 1770 transitions, 34593 flow, removed 36 selfloop flow, removed 98 redundant places. [2025-04-13 21:10:04,237 INFO L231 Difference]: Finished difference. Result has 574 places, 245 transitions, 2168 flow [2025-04-13 21:10:04,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=2168, PETRI_PLACES=574, PETRI_TRANSITIONS=245} [2025-04-13 21:10:04,238 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 551 predicate places. [2025-04-13 21:10:04,238 INFO L485 AbstractCegarLoop]: Abstraction has has 574 places, 245 transitions, 2168 flow [2025-04-13 21:10:04,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 3.0591133004926108) internal successors, (621), 203 states have internal predecessors, (621), 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 21:10:04,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:10:04,240 INFO L206 CegarLoopForPetriNet]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:10:04,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 21:10:04,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:10:04,440 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:10:04,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:10:04,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1110367566, now seen corresponding path program 7 times [2025-04-13 21:10:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:10:04,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400088809] [2025-04-13 21:10:04,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:10:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:10:04,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 21:10:04,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 21:10:04,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:10:04,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:10:04,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:10:04,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 21:10:04,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 21:10:04,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:10:04,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:10:04,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:10:04,622 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:10:04,623 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 21:10:04,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 21:10:04,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 21:10:04,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 21:10:04,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 21:10:04,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:10:04,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 21:10:04,625 INFO L422 BasicCegarLoop]: Path program histogram: [7, 6, 3, 3, 1, 1, 1, 1] [2025-04-13 21:10:04,734 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:10:04,734 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:10:04,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:10:04 BasicIcfg [2025-04-13 21:10:04,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:10:04,738 INFO L158 Benchmark]: Toolchain (without parser) took 104256.86ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 106.6MB in the beginning and 966.8MB in the end (delta: -860.2MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-04-13 21:10:04,738 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 83.2MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:10:04,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.39ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 83.3MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:10:04,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.12ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:10:04,738 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 80.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:10:04,738 INFO L158 Benchmark]: RCFGBuilder took 337.31ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 57.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:10:04,738 INFO L158 Benchmark]: TraceAbstraction took 103428.71ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 56.5MB in the beginning and 966.8MB in the end (delta: -910.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-13 21:10:04,739 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.37ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 83.2MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.39ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 83.3MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.12ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 80.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 337.31ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 57.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 103428.71ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 56.5MB in the beginning and 966.8MB in the end (delta: -910.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 100 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=-1] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=101] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=100, expression=0, limit=100] - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 35 locations, 38 edges, 6 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: 103.2s, OverallIterations: 23, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 63.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15073 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15044 mSDsluCounter, 2131 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2055 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8879 IncrementalHoareTripleChecker+Invalid, 9138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 76 mSDtfsCounter, 8879 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2135 GetRequests, 216 SyntacticMatches, 179 SemanticMatches, 1740 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136408 ImplicationChecksByTransitivity, 46.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2388occurred in iteration=20, InterpolantAutomatonStates: 729, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 1236 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 357 NumberOfCheckSat, 1582 ConstructedInterpolants, 0 QuantifiedInterpolants, 7798 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2430 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 56 InterpolantComputations, 6 PerfectInterpolantSequences, 200/35476 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 21:10:04,751 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...