/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:50:05,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:50:05,923 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 23:50:05,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:50:05,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:50:05,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:50:05,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:50:05,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:50:05,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:50:05,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:50:05,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:50:05,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:50:05,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:50:05,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:50:05,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:50:05,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:50:05,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:50:05,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:50:05,955 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:50:05,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:50:05,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:50:05,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:50:05,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:50:05,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:50:05,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:50:05,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:50:06,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:50:06,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:50:06,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:50:06,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:50:06,170 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:50:06,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2025-04-13 23:50:07,502 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1778868/d841674c879445328a069880c110d58c/FLAG2697ac088 [2025-04-13 23:50:07,785 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:50:07,786 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2025-04-13 23:50:07,805 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1778868/d841674c879445328a069880c110d58c/FLAG2697ac088 [2025-04-13 23:50:08,502 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1778868/d841674c879445328a069880c110d58c [2025-04-13 23:50:08,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:50:08,506 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:50:08,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:50:08,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:50:08,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:50:08,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599bbc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08, skipping insertion in model container [2025-04-13 23:50:08,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:50:08,741 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-ext/11_fmaxsymopt.i[30863,30876] [2025-04-13 23:50:08,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:50:08,768 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:50:08,813 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-ext/11_fmaxsymopt.i[30863,30876] [2025-04-13 23:50:08,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:50:08,845 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:50:08,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08 WrapperNode [2025-04-13 23:50:08,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:50:08,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:50:08,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:50:08,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:50:08,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,888 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-04-13 23:50:08,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:50:08,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:50:08,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:50:08,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:50:08,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,918 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-04-13 23:50:08,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:50:08,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:50:08,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:50:08,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:50:08,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (1/1) ... [2025-04-13 23:50:08,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:50:08,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:08,967 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 23:50:08,969 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 23:50:08,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:50:08,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:50:08,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:50:08,988 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:50:08,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:50:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:50:08,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:50:08,990 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:50:09,075 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:50:09,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:50:09,220 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:50:09,221 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:50:09,221 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:50:09,347 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:50:09,350 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:50:09,353 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:50:09,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:50:09 BoogieIcfgContainer [2025-04-13 23:50:09,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:50:09,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:50:09,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:50:09,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:50:09,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:50:08" (1/3) ... [2025-04-13 23:50:09,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f18855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:50:09, skipping insertion in model container [2025-04-13 23:50:09,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:08" (2/3) ... [2025-04-13 23:50:09,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f18855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:50:09, skipping insertion in model container [2025-04-13 23:50:09,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:50:09" (3/3) ... [2025-04-13 23:50:09,359 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-04-13 23:50:09,369 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:50:09,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 17 locations, 21 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:50:09,370 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:50:09,403 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:09,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 22 transitions, 48 flow [2025-04-13 23:50:09,449 INFO L116 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-04-13 23:50:09,451 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:09,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 4/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 29 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-04-13 23:50:09,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 22 transitions, 48 flow [2025-04-13 23:50:09,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 21 transitions, 46 flow [2025-04-13 23:50:09,463 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:09,474 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;@1d184cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:09,475 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:50:09,479 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:09,479 INFO L116 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-04-13 23:50:09,479 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:09,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:09,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:50:09,480 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:50:09,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash 222715045, now seen corresponding path program 1 times [2025-04-13 23:50:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:09,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119315744] [2025-04-13 23:50:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:09,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:50:09,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:50:09,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:09,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:09,689 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 23:50:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:09,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119315744] [2025-04-13 23:50:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119315744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:50:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783947262] [2025-04-13 23:50:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:09,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:09,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:09,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:50:09,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-04-13 23:50:09,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23:50:09,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:09,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-04-13 23:50:09,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:09,768 INFO L116 PetriNetUnfolderBase]: 12/41 cut-off events. [2025-04-13 23:50:09,768 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:09,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 41 events. 12/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 9 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 63. Up to 35 conditions per place. [2025-04-13 23:50:09,769 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 14 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-13 23:50:09,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 74 flow [2025-04-13 23:50:09,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:50:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:50:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-13 23:50:09,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-04-13 23:50:09,778 INFO L175 Difference]: Start difference. First operand has 20 places, 21 transitions, 46 flow. Second operand 3 states and 29 transitions. [2025-04-13 23:50:09,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 74 flow [2025-04-13 23:50:09,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 74 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:09,783 INFO L231 Difference]: Finished difference. Result has 22 places, 19 transitions, 52 flow [2025-04-13 23:50:09,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=22, PETRI_TRANSITIONS=19} [2025-04-13 23:50:09,787 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2025-04-13 23:50:09,787 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 52 flow [2025-04-13 23:50:09,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23:50:09,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:09,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:50:09,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:50:09,788 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:50:09,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1687392205, now seen corresponding path program 1 times [2025-04-13 23:50:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:09,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84208806] [2025-04-13 23:50:09,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:09,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:09,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:09,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:09,863 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 23:50:09,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:09,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84208806] [2025-04-13 23:50:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84208806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:09,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101203012] [2025-04-13 23:50:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:09,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:09,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:09,868 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 23:50:09,869 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 23:50:09,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:09,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:09,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:50:09,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:09,955 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 23:50:09,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:09,972 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 23:50:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101203012] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:09,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 23:50:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65898896] [2025-04-13 23:50:09,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:09,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:50:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:09,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:50:09,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:50:09,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-04-13 23:50:09,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 52 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:50:09,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:09,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-04-13 23:50:09,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:10,034 INFO L116 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-04-13 23:50:10,035 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:10,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 44 events. 12/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 9 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 85. Up to 35 conditions per place. [2025-04-13 23:50:10,035 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 14 selfloop transitions, 5 changer transitions 0/22 dead transitions. [2025-04-13 23:50:10,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 102 flow [2025-04-13 23:50:10,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:50:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:50:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-04-13 23:50:10,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2025-04-13 23:50:10,039 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 52 flow. Second operand 6 states and 40 transitions. [2025-04-13 23:50:10,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 102 flow [2025-04-13 23:50:10,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 98 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:10,040 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 84 flow [2025-04-13 23:50:10,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2025-04-13 23:50:10,041 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-13 23:50:10,041 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 84 flow [2025-04-13 23:50:10,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:50:10,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:10,041 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 23:50:10,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:50:10,242 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 23:50:10,242 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:50:10,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1879950514, now seen corresponding path program 2 times [2025-04-13 23:50:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:10,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772725009] [2025-04-13 23:50:10,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:10,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:10,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 23:50:10,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:10,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:10,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:10,371 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 23:50:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:10,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772725009] [2025-04-13 23:50:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772725009] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:10,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239960247] [2025-04-13 23:50:10,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:10,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:10,374 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 23:50:10,376 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 23:50:10,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 23:50:10,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:10,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:10,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:10,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:50:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:10,455 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 23:50:10,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:10,494 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 23:50:10,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239960247] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:10,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:10,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 23:50:10,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134470692] [2025-04-13 23:50:10,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:10,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:50:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:10,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:50:10,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:50:10,495 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-04-13 23:50:10,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 23:50:10,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:10,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-04-13 23:50:10,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:10,558 INFO L116 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-04-13 23:50:10,558 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 23:50:10,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 46 events. 12/46 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 9 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 76. Up to 35 conditions per place. [2025-04-13 23:50:10,559 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 14 selfloop transitions, 7 changer transitions 0/24 dead transitions. [2025-04-13 23:50:10,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 138 flow [2025-04-13 23:50:10,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:50:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:50:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2025-04-13 23:50:10,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26704545454545453 [2025-04-13 23:50:10,561 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 84 flow. Second operand 8 states and 47 transitions. [2025-04-13 23:50:10,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 138 flow [2025-04-13 23:50:10,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 24 transitions, 124 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:10,563 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 106 flow [2025-04-13 23:50:10,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2025-04-13 23:50:10,564 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-04-13 23:50:10,564 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 106 flow [2025-04-13 23:50:10,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 23:50:10,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:10,564 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1] [2025-04-13 23:50:10,572 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 23:50:10,764 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,SelfDestructingSolverStorable2 [2025-04-13 23:50:10,765 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:50:10,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1600705326, now seen corresponding path program 3 times [2025-04-13 23:50:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:10,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858823809] [2025-04-13 23:50:10,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:50:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:10,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 4 equivalence classes. [2025-04-13 23:50:10,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:50:10,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:50:10,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:10,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:10,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:50:10,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:50:10,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:10,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:10,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:10,836 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:10,837 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:50:10,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:50:10,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:50:10,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:50:10,839 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 23:50:10,841 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:10,841 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:50:10,862 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:10,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 84 flow [2025-04-13 23:50:10,872 INFO L116 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-04-13 23:50:10,872 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:50:10,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 39 events. 7/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2025-04-13 23:50:10,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 84 flow [2025-04-13 23:50:10,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 36 transitions, 82 flow [2025-04-13 23:50:10,873 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:10,874 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;@1d184cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:10,874 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:50:10,876 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:10,876 INFO L116 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-04-13 23:50:10,876 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:10,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:10,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:50:10,876 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:50:10,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 258038232, now seen corresponding path program 1 times [2025-04-13 23:50:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:10,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375600264] [2025-04-13 23:50:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:10,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:50:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:50:10,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:10,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:10,926 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 23:50:10,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:10,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375600264] [2025-04-13 23:50:10,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375600264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:10,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:10,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:50:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137325888] [2025-04-13 23:50:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:10,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:10,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:10,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:50:10,927 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2025-04-13 23:50:10,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 23:50:10,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:10,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2025-04-13 23:50:10,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:11,026 INFO L116 PetriNetUnfolderBase]: 322/576 cut-off events. [2025-04-13 23:50:11,026 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-13 23:50:11,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 576 events. 322/576 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2211 event pairs, 279 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 776. Up to 545 conditions per place. [2025-04-13 23:50:11,032 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 25 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-04-13 23:50:11,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 128 flow [2025-04-13 23:50:11,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:50:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:50:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-13 23:50:11,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-04-13 23:50:11,034 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 82 flow. Second operand 3 states and 48 transitions. [2025-04-13 23:50:11,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 128 flow [2025-04-13 23:50:11,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:11,035 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2025-04-13 23:50:11,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-04-13 23:50:11,035 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-04-13 23:50:11,035 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2025-04-13 23:50:11,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 23:50:11,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:11,035 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:11,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:50:11,036 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:50:11,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1558639311, now seen corresponding path program 1 times [2025-04-13 23:50:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:11,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309139009] [2025-04-13 23:50:11,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:11,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:50:11,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:50:11,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:11,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:11,074 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 23:50:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:11,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309139009] [2025-04-13 23:50:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309139009] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:11,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064767406] [2025-04-13 23:50:11,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:11,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:11,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:11,077 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 23:50:11,078 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 23:50:11,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:50:11,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:50:11,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:11,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:11,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:50:11,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:11,144 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 23:50:11,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:11,163 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 23:50:11,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064767406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:11,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:11,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 23:50:11,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264699935] [2025-04-13 23:50:11,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:11,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:50:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:11,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:50:11,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:50:11,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2025-04-13 23:50:11,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 23:50:11,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:11,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2025-04-13 23:50:11,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:11,275 INFO L116 PetriNetUnfolderBase]: 322/579 cut-off events. [2025-04-13 23:50:11,275 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-13 23:50:11,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 579 events. 322/579 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2226 event pairs, 279 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 1160. Up to 545 conditions per place. [2025-04-13 23:50:11,280 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 25 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2025-04-13 23:50:11,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 156 flow [2025-04-13 23:50:11,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:50:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:50:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-04-13 23:50:11,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28378378378378377 [2025-04-13 23:50:11,282 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 6 states and 63 transitions. [2025-04-13 23:50:11,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 156 flow [2025-04-13 23:50:11,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 152 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:11,284 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 116 flow [2025-04-13 23:50:11,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-04-13 23:50:11,284 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2025-04-13 23:50:11,284 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 116 flow [2025-04-13 23:50:11,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 23:50:11,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:11,284 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-04-13 23:50:11,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:50:11,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:11,489 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:50:11,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash -803971565, now seen corresponding path program 2 times [2025-04-13 23:50:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:11,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921924191] [2025-04-13 23:50:11,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:11,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 23:50:11,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:50:11,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:11,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:11,583 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 23:50:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:11,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921924191] [2025-04-13 23:50:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921924191] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:11,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832403014] [2025-04-13 23:50:11,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:11,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:11,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:11,587 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 23:50:11,590 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 23:50:11,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 23:50:11,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:50:11,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:11,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:11,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:50:11,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:11,662 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 23:50:11,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:11,696 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 23:50:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832403014] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:11,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 23:50:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106042514] [2025-04-13 23:50:11,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:11,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:50:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:11,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:50:11,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:50:11,697 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2025-04-13 23:50:11,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 116 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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 23:50:11,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:11,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2025-04-13 23:50:11,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:11,802 INFO L116 PetriNetUnfolderBase]: 322/581 cut-off events. [2025-04-13 23:50:11,803 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-13 23:50:11,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 581 events. 322/581 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2215 event pairs, 279 based on Foata normal form. 2/538 useless extension candidates. Maximal degree in co-relation 1151. Up to 545 conditions per place. [2025-04-13 23:50:11,807 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 25 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2025-04-13 23:50:11,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 192 flow [2025-04-13 23:50:11,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:50:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:50:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2025-04-13 23:50:11,809 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25 [2025-04-13 23:50:11,809 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 116 flow. Second operand 8 states and 74 transitions. [2025-04-13 23:50:11,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 192 flow [2025-04-13 23:50:11,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 37 transitions, 178 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:11,811 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 138 flow [2025-04-13 23:50:11,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-04-13 23:50:11,812 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2025-04-13 23:50:11,812 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 138 flow [2025-04-13 23:50:11,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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 23:50:11,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:11,812 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-04-13 23:50:11,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:50:12,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:12,012 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:50:12,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1719593581, now seen corresponding path program 3 times [2025-04-13 23:50:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:12,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515146499] [2025-04-13 23:50:12,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:50:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:12,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-04-13 23:50:12,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:50:12,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:50:12,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:12,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:12,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:50:12,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:50:12,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:12,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:12,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:12,050 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:12,050 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:50:12,050 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:50:12,051 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:50:12,051 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:50:12,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:50:12,051 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 23:50:12,051 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:12,051 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:50:12,077 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:12,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 52 transitions, 122 flow [2025-04-13 23:50:12,085 INFO L116 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-04-13 23:50:12,085 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:50:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 10/56 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2025-04-13 23:50:12,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 52 transitions, 122 flow [2025-04-13 23:50:12,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 120 flow [2025-04-13 23:50:12,089 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:12,089 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;@1d184cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:12,089 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:50:12,090 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:12,090 INFO L116 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-04-13 23:50:12,090 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:12,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:12,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:50:12,091 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:50:12,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 307675546, now seen corresponding path program 1 times [2025-04-13 23:50:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:12,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861824316] [2025-04-13 23:50:12,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:12,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:50:12,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:50:12,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:12,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:12,114 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 23:50:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:12,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861824316] [2025-04-13 23:50:12,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861824316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:12,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:12,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:50:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993212995] [2025-04-13 23:50:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:12,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:12,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:12,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:50:12,115 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2025-04-13 23:50:12,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 23:50:12,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:12,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2025-04-13 23:50:12,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:12,683 INFO L116 PetriNetUnfolderBase]: 5422/7856 cut-off events. [2025-04-13 23:50:12,684 INFO L117 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2025-04-13 23:50:12,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15938 conditions, 7856 events. 5422/7856 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 39900 event pairs, 4779 based on Foata normal form. 0/7171 useless extension candidates. Maximal degree in co-relation 8402. Up to 7645 conditions per place. [2025-04-13 23:50:12,727 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 36 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-04-13 23:50:12,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 184 flow [2025-04-13 23:50:12,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:50:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:50:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 23:50:12,729 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2025-04-13 23:50:12,729 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 120 flow. Second operand 3 states and 67 transitions. [2025-04-13 23:50:12,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 184 flow [2025-04-13 23:50:12,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 182 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:12,731 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 116 flow [2025-04-13 23:50:12,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-04-13 23:50:12,732 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-04-13 23:50:12,732 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 116 flow [2025-04-13 23:50:12,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 23:50:12,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:12,732 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:12,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:50:12,735 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:50:12,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1789509016, now seen corresponding path program 1 times [2025-04-13 23:50:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:12,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357027786] [2025-04-13 23:50:12,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:12,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:50:12,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:50:12,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:12,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:12,767 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 23:50:12,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:12,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357027786] [2025-04-13 23:50:12,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357027786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:12,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518787349] [2025-04-13 23:50:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:12,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:12,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:12,769 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 23:50:12,771 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 23:50:12,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:50:12,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:50:12,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:12,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:12,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:50:12,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:12,842 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 23:50:12,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:12,857 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 23:50:12,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518787349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:12,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 23:50:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801255773] [2025-04-13 23:50:12,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:12,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:50:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:12,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:50:12,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:50:12,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2025-04-13 23:50:12,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 23:50:12,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:12,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2025-04-13 23:50:12,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:13,416 INFO L116 PetriNetUnfolderBase]: 5422/7859 cut-off events. [2025-04-13 23:50:13,417 INFO L117 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2025-04-13 23:50:13,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15854 conditions, 7859 events. 5422/7859 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 39885 event pairs, 4779 based on Foata normal form. 0/7174 useless extension candidates. Maximal degree in co-relation 15840. Up to 7645 conditions per place. [2025-04-13 23:50:13,463 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 36 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-13 23:50:13,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 210 flow [2025-04-13 23:50:13,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:50:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:50:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-13 23:50:13,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27564102564102566 [2025-04-13 23:50:13,465 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 116 flow. Second operand 6 states and 86 transitions. [2025-04-13 23:50:13,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 210 flow [2025-04-13 23:50:13,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 206 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:13,466 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 148 flow [2025-04-13 23:50:13,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-04-13 23:50:13,467 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-04-13 23:50:13,467 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 148 flow [2025-04-13 23:50:13,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 23:50:13,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:13,467 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:13,473 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 23:50:13,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 23:50:13,668 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:50:13,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash 872228192, now seen corresponding path program 2 times [2025-04-13 23:50:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:13,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455564509] [2025-04-13 23:50:13,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:13,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 23:50:13,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:50:13,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:13,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:13,736 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 23:50:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:13,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455564509] [2025-04-13 23:50:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455564509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:13,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147051764] [2025-04-13 23:50:13,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:13,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:13,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:13,739 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 23:50:13,741 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 23:50:13,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 23:50:13,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:50:13,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:13,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:13,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:50:13,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:13,817 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 23:50:13,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:13,846 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 23:50:13,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147051764] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:13,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:13,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 23:50:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447432165] [2025-04-13 23:50:13,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:13,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:50:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:13,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:50:13,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:50:13,848 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2025-04-13 23:50:13,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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 23:50:13,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:13,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2025-04-13 23:50:13,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:14,322 INFO L116 PetriNetUnfolderBase]: 5422/7861 cut-off events. [2025-04-13 23:50:14,322 INFO L117 PetriNetUnfolderBase]: For 357/357 co-relation queries the response was YES. [2025-04-13 23:50:14,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15875 conditions, 7861 events. 5422/7861 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 39851 event pairs, 4779 based on Foata normal form. 2/7179 useless extension candidates. Maximal degree in co-relation 15831. Up to 7645 conditions per place. [2025-04-13 23:50:14,354 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 36 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-04-13 23:50:14,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 50 transitions, 246 flow [2025-04-13 23:50:14,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:50:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:50:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-04-13 23:50:14,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24278846153846154 [2025-04-13 23:50:14,356 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 148 flow. Second operand 8 states and 101 transitions. [2025-04-13 23:50:14,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 50 transitions, 246 flow [2025-04-13 23:50:14,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 50 transitions, 232 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:14,357 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 170 flow [2025-04-13 23:50:14,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-04-13 23:50:14,358 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2025-04-13 23:50:14,358 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 170 flow [2025-04-13 23:50:14,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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 23:50:14,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,358 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:14,366 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 23:50:14,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:14,559 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:50:14,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1991804512, now seen corresponding path program 3 times [2025-04-13 23:50:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671125200] [2025-04-13 23:50:14,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:50:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 4 equivalence classes. [2025-04-13 23:50:14,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:50:14,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:50:14,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:14,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:50:14,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:50:14,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:14,589 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:14,589 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:50:14,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:50:14,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:50:14,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:50:14,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:50:14,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:50:14,589 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 23:50:14,590 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:14,590 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:50:14,610 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:14,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 67 transitions, 162 flow [2025-04-13 23:50:14,616 INFO L116 PetriNetUnfolderBase]: 13/73 cut-off events. [2025-04-13 23:50:14,616 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:50:14,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 73 events. 13/73 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 224 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 66. Up to 5 conditions per place. [2025-04-13 23:50:14,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 67 transitions, 162 flow [2025-04-13 23:50:14,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 66 transitions, 160 flow [2025-04-13 23:50:14,617 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:14,618 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;@1d184cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:14,618 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:50:14,619 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:14,619 INFO L116 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-04-13 23:50:14,619 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:14,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:50:14,619 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:50:14,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash 371627883, now seen corresponding path program 1 times [2025-04-13 23:50:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895149592] [2025-04-13 23:50:14,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:50:14,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:50:14,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:14,639 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 23:50:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:14,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895149592] [2025-04-13 23:50:14,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895149592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:14,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:50:14,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16401700] [2025-04-13 23:50:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:14,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:14,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:14,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:14,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:50:14,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2025-04-13 23:50:14,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 23:50:14,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:14,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2025-04-13 23:50:14,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:19,494 INFO L116 PetriNetUnfolderBase]: 76422/100448 cut-off events. [2025-04-13 23:50:19,494 INFO L117 PetriNetUnfolderBase]: For 10891/10891 co-relation queries the response was YES. [2025-04-13 23:50:19,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204531 conditions, 100448 events. 76422/100448 cut-off events. For 10891/10891 co-relation queries the response was YES. Maximal size of possible extension queue 2080. Compared 578586 event pairs, 67779 based on Foata normal form. 0/91315 useless extension candidates. Maximal degree in co-relation 52186. Up to 98645 conditions per place. [2025-04-13 23:50:20,200 INFO L140 encePairwiseOnDemand]: 55/67 looper letters, 47 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-04-13 23:50:20,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 242 flow [2025-04-13 23:50:20,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:50:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:50:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-04-13 23:50:20,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42786069651741293 [2025-04-13 23:50:20,202 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 160 flow. Second operand 3 states and 86 transitions. [2025-04-13 23:50:20,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 242 flow [2025-04-13 23:50:20,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 236 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:20,208 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 148 flow [2025-04-13 23:50:20,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-04-13 23:50:20,210 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-04-13 23:50:20,210 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 148 flow [2025-04-13 23:50:20,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 23:50:20,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:20,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:20,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:50:20,210 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:50:20,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash 964753426, now seen corresponding path program 1 times [2025-04-13 23:50:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:20,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126151921] [2025-04-13 23:50:20,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:50:20,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:50:20,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:20,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:20,252 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 23:50:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:20,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126151921] [2025-04-13 23:50:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126151921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:20,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488505793] [2025-04-13 23:50:20,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:20,255 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 23:50:20,256 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 23:50:20,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:50:20,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:50:20,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:20,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:20,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-13 23:50:20,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:50:20,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:50:20,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488505793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:20,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:50:20,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-04-13 23:50:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372688334] [2025-04-13 23:50:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:20,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:20,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:20,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:20,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:50:20,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 67 [2025-04-13 23:50:20,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 23:50:20,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:20,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 67 [2025-04-13 23:50:20,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:26,446 INFO L116 PetriNetUnfolderBase]: 91706/120336 cut-off events. [2025-04-13 23:50:26,446 INFO L117 PetriNetUnfolderBase]: For 4342/4342 co-relation queries the response was YES. [2025-04-13 23:50:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242720 conditions, 120336 events. 91706/120336 cut-off events. For 4342/4342 co-relation queries the response was YES. Maximal size of possible extension queue 2371. Compared 702821 event pairs, 74779 based on Foata normal form. 0/107758 useless extension candidates. Maximal degree in co-relation 242705. Up to 108510 conditions per place. [2025-04-13 23:50:27,074 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 83 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-04-13 23:50:27,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 403 flow [2025-04-13 23:50:27,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:50:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:50:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-13 23:50:27,075 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5422885572139303 [2025-04-13 23:50:27,076 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 148 flow. Second operand 3 states and 109 transitions. [2025-04-13 23:50:27,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 403 flow [2025-04-13 23:50:27,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 399 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:27,080 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 156 flow [2025-04-13 23:50:27,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-04-13 23:50:27,081 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-04-13 23:50:27,081 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 156 flow [2025-04-13 23:50:27,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 23:50:27,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:27,081 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:27,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 23:50:27,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:27,281 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:50:27,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash -793143842, now seen corresponding path program 1 times [2025-04-13 23:50:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:27,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107034913] [2025-04-13 23:50:27,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:27,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:50:27,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:50:27,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:27,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:27,313 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 23:50:27,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:27,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107034913] [2025-04-13 23:50:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107034913] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:27,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227196352] [2025-04-13 23:50:27,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:27,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:27,316 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 23:50:27,317 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 23:50:27,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:50:27,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:50:27,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:27,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:27,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:50:27,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:27,399 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 23:50:27,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:27,412 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 23:50:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227196352] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:27,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:27,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 23:50:27,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361503461] [2025-04-13 23:50:27,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:27,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:50:27,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:27,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:50:27,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:50:27,413 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2025-04-13 23:50:27,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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 23:50:27,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:27,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2025-04-13 23:50:27,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:33,061 INFO L116 PetriNetUnfolderBase]: 84064/110479 cut-off events. [2025-04-13 23:50:33,061 INFO L117 PetriNetUnfolderBase]: For 15110/17329 co-relation queries the response was YES. [2025-04-13 23:50:33,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231561 conditions, 110479 events. 84064/110479 cut-off events. For 15110/17329 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 640320 event pairs, 74779 based on Foata normal form. 0/100765 useless extension candidates. Maximal degree in co-relation 231532. Up to 108509 conditions per place. [2025-04-13 23:50:33,683 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 48 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-04-13 23:50:33,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 274 flow [2025-04-13 23:50:33,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:50:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:50:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-04-13 23:50:33,684 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27114427860696516 [2025-04-13 23:50:33,684 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 156 flow. Second operand 6 states and 109 transitions. [2025-04-13 23:50:33,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 274 flow [2025-04-13 23:50:33,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 270 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:33,693 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 188 flow [2025-04-13 23:50:33,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-04-13 23:50:33,694 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2025-04-13 23:50:33,694 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 188 flow [2025-04-13 23:50:33,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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 23:50:33,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:33,694 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:33,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:50:33,894 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,SelfDestructingSolverStorable14 [2025-04-13 23:50:33,895 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:50:33,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1861673529, now seen corresponding path program 2 times [2025-04-13 23:50:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:33,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759056556] [2025-04-13 23:50:33,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:33,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:50:33,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:50:33,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:33,949 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 23:50:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:33,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759056556] [2025-04-13 23:50:33,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759056556] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:33,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293122599] [2025-04-13 23:50:33,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:50:33,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:33,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:33,953 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 23:50:33,954 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 23:50:34,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:50:34,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:50:34,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:50:34,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:34,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:50:34,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:34,048 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 23:50:34,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:34,086 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 23:50:34,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293122599] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:34,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 23:50:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381703325] [2025-04-13 23:50:34,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:34,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:50:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:34,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:50:34,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:50:34,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2025-04-13 23:50:34,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 188 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 23:50:34,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:34,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2025-04-13 23:50:34,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:39,810 INFO L116 PetriNetUnfolderBase]: 84064/110481 cut-off events. [2025-04-13 23:50:39,810 INFO L117 PetriNetUnfolderBase]: For 8454/10673 co-relation queries the response was YES. [2025-04-13 23:50:40,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227140 conditions, 110481 events. 84064/110481 cut-off events. For 8454/10673 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 640080 event pairs, 74779 based on Foata normal form. 2/100770 useless extension candidates. Maximal degree in co-relation 227094. Up to 108509 conditions per place. [2025-04-13 23:50:40,504 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 48 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-04-13 23:50:40,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 64 transitions, 310 flow [2025-04-13 23:50:40,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:50:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:50:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-04-13 23:50:40,505 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23880597014925373 [2025-04-13 23:50:40,505 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 188 flow. Second operand 8 states and 128 transitions. [2025-04-13 23:50:40,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 64 transitions, 310 flow [2025-04-13 23:50:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 64 transitions, 296 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:50:40,513 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 210 flow [2025-04-13 23:50:40,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2025-04-13 23:50:40,513 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 19 predicate places. [2025-04-13 23:50:40,513 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 210 flow [2025-04-13 23:50:40,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 23:50:40,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:40,514 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:40,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:50:40,718 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,SelfDestructingSolverStorable15 [2025-04-13 23:50:40,718 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:50:40,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash 369110745, now seen corresponding path program 3 times [2025-04-13 23:50:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:40,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166647902] [2025-04-13 23:50:40,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:50:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:40,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 4 equivalence classes. [2025-04-13 23:50:40,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:50:40,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:50:40,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:40,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:40,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:50:40,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:50:40,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:40,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:40,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:40,760 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:40,760 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:50:40,760 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:50:40,762 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:50:40,762 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:50:40,762 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:50:40,762 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:50:40,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:50:40,762 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-13 23:50:40,762 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:40,762 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:50:40,798 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:40,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 82 transitions, 204 flow [2025-04-13 23:50:40,806 INFO L116 PetriNetUnfolderBase]: 16/90 cut-off events. [2025-04-13 23:50:40,807 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:50:40,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 90 events. 16/90 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 289 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2025-04-13 23:50:40,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 82 transitions, 204 flow [2025-04-13 23:50:40,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 81 transitions, 202 flow [2025-04-13 23:50:40,808 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:40,809 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;@1d184cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:40,809 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:50:40,810 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:40,810 INFO L116 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-04-13 23:50:40,810 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:40,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:40,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:50:40,810 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:50:40,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 449893899, now seen corresponding path program 1 times [2025-04-13 23:50:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:40,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788722164] [2025-04-13 23:50:40,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:40,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:50:40,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:50:40,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:40,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:40,830 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 23:50:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:40,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788722164] [2025-04-13 23:50:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788722164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:40,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:50:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016644727] [2025-04-13 23:50:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:40,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:40,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:40,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:50:40,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 82 [2025-04-13 23:50:40,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:50:40,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:40,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 82 [2025-04-13 23:50:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand