/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:14:12,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:14:12,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:14:12,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:14:12,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:14:12,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:14:12,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:14:12,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:14:12,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:14:12,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:14:12,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:14:12,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:14:12,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:14:12,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:14:12,884 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:14:12,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:14:12,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:14:12,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:14:12,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:14:12,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:14:12,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:14:12,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:14:13,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:14:13,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:14:13,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:14:13,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:14:13,119 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:14:13,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2025-04-13 19:14:14,426 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeab2641e/566cffbeb36046ab800cef681f53a36d/FLAG789c14ed8 [2025-04-13 19:14:14,725 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:14:14,725 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2025-04-13 19:14:14,742 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeab2641e/566cffbeb36046ab800cef681f53a36d/FLAG789c14ed8 [2025-04-13 19:14:15,476 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeab2641e/566cffbeb36046ab800cef681f53a36d [2025-04-13 19:14:15,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:14:15,479 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:14:15,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:14:15,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:14:15,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:14:15,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:15,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3150c1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15, skipping insertion in model container [2025-04-13 19:14:15,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:15,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:14:15,780 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/stack_longest-2.i[41530,41543] [2025-04-13 19:14:15,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:14:15,839 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:14:15,885 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/stack_longest-2.i[41530,41543] [2025-04-13 19:14:15,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:14:15,970 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:14:15,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15 WrapperNode [2025-04-13 19:14:15,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:14:15,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:14:15,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:14:15,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:14:15,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:15,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,054 INFO L138 Inliner]: procedures = 277, calls = 830, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 939 [2025-04-13 19:14:16,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:14:16,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:14:16,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:14:16,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:14:16,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,107 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2025-04-13 19:14:16,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:14:16,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:14:16,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:14:16,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:14:16,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (1/1) ... [2025-04-13 19:14:16,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:14:16,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:16,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:14:16,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:14:16,212 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 19:14:16,212 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 19:14:16,212 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 19:14:16,212 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:14:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:14:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:14:16,214 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:14:16,331 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:14:16,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:14:17,242 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:14:17,243 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:14:17,243 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:14:28,142 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:14:28,143 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:14:28,150 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:14:28,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:14:28 BoogieIcfgContainer [2025-04-13 19:14:28,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:14:28,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:14:28,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:14:28,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:14:28,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:14:15" (1/3) ... [2025-04-13 19:14:28,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427bb87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:14:28, skipping insertion in model container [2025-04-13 19:14:28,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:15" (2/3) ... [2025-04-13 19:14:28,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427bb87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:14:28, skipping insertion in model container [2025-04-13 19:14:28,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:14:28" (3/3) ... [2025-04-13 19:14:28,164 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-04-13 19:14:28,176 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:14:28,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 19:14:28,178 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:14:28,246 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:14:28,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 19:14:28,318 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-13 19:14:28,319 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:14:28,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 19:14:28,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 19:14:28,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 53 flow [2025-04-13 19:14:28,333 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:14:28,346 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;@39941c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:14:28,346 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:14:28,371 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:14:28,372 INFO L116 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-04-13 19:14:28,372 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:14:28,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:28,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:14:28,373 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:28,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1901818711, now seen corresponding path program 1 times [2025-04-13 19:14:28,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:28,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775251099] [2025-04-13 19:14:28,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:28,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:28,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:14:28,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:14:28,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:28,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:29,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775251099] [2025-04-13 19:14:29,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775251099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:29,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:14:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216853746] [2025-04-13 19:14:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:29,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:14:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:29,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:14:29,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:14:29,065 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:29,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:29,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:29,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:29,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:29,259 INFO L116 PetriNetUnfolderBase]: 206/352 cut-off events. [2025-04-13 19:14:29,259 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:14:29,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 352 events. 206/352 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1207 event pairs, 52 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 690. Up to 263 conditions per place. [2025-04-13 19:14:29,265 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-13 19:14:29,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 136 flow [2025-04-13 19:14:29,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:14:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:14:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 19:14:29,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 19:14:29,277 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 53 flow. Second operand 3 states and 42 transitions. [2025-04-13 19:14:29,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 136 flow [2025-04-13 19:14:29,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:14:29,283 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 58 flow [2025-04-13 19:14:29,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 19:14:29,288 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 19:14:29,288 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 58 flow [2025-04-13 19:14:29,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:29,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:29,288 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:29,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:14:29,289 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:29,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1461569350, now seen corresponding path program 1 times [2025-04-13 19:14:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:29,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444355104] [2025-04-13 19:14:29,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:29,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:29,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:14:29,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:14:29,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:29,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:29,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:29,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444355104] [2025-04-13 19:14:29,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444355104] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:29,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079084966] [2025-04-13 19:14:29,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:29,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:29,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:29,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:14:29,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:14:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:14:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:30,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:30,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 19:14:30,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:30,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:30,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079084966] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:30,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:30,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-04-13 19:14:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718985154] [2025-04-13 19:14:30,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:30,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:14:30,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:30,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:14:30,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:14:30,369 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:30,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 58 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:30,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:30,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:30,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:30,750 INFO L116 PetriNetUnfolderBase]: 771/1322 cut-off events. [2025-04-13 19:14:30,750 INFO L117 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-04-13 19:14:30,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1322 events. 771/1322 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5765 event pairs, 54 based on Foata normal form. 11/1141 useless extension candidates. Maximal degree in co-relation 2517. Up to 270 conditions per place. [2025-04-13 19:14:30,757 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 94 selfloop transitions, 17 changer transitions 2/113 dead transitions. [2025-04-13 19:14:30,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 113 transitions, 506 flow [2025-04-13 19:14:30,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:14:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:14:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-04-13 19:14:30,758 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2025-04-13 19:14:30,758 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 58 flow. Second operand 8 states and 134 transitions. [2025-04-13 19:14:30,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 113 transitions, 506 flow [2025-04-13 19:14:30,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 113 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:14:30,761 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 194 flow [2025-04-13 19:14:30,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2025-04-13 19:14:30,762 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-13 19:14:30,762 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 194 flow [2025-04-13 19:14:30,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:30,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:30,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:30,771 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 19:14:30,962 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 19:14:30,963 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:30,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash -312777050, now seen corresponding path program 1 times [2025-04-13 19:14:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:30,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083156235] [2025-04-13 19:14:30,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:14:31,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:14:31,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:31,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:31,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083156235] [2025-04-13 19:14:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083156235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:14:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747601288] [2025-04-13 19:14:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:31,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:14:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:31,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:14:31,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:14:31,342 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:31,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:31,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:31,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:31,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:31,481 INFO L116 PetriNetUnfolderBase]: 531/934 cut-off events. [2025-04-13 19:14:31,481 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-13 19:14:31,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 934 events. 531/934 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3976 event pairs, 194 based on Foata normal form. 52/830 useless extension candidates. Maximal degree in co-relation 2011. Up to 505 conditions per place. [2025-04-13 19:14:31,487 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 43 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-04-13 19:14:31,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 303 flow [2025-04-13 19:14:31,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:14:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:14:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 19:14:31,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 19:14:31,488 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 194 flow. Second operand 3 states and 38 transitions. [2025-04-13 19:14:31,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 303 flow [2025-04-13 19:14:31,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 283 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-13 19:14:31,494 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 174 flow [2025-04-13 19:14:31,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-13 19:14:31,495 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2025-04-13 19:14:31,495 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 174 flow [2025-04-13 19:14:31,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:31,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:31,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:31,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:14:31,496 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:31,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1480889152, now seen corresponding path program 1 times [2025-04-13 19:14:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:31,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81619858] [2025-04-13 19:14:31,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:31,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:14:31,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:14:31,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:31,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:32,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:32,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81619858] [2025-04-13 19:14:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81619858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:32,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:14:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040504320] [2025-04-13 19:14:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:32,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:14:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:32,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:14:32,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:14:32,607 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:32,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:32,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:32,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:32,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:32,828 INFO L116 PetriNetUnfolderBase]: 583/1026 cut-off events. [2025-04-13 19:14:32,828 INFO L117 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-04-13 19:14:32,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2648 conditions, 1026 events. 583/1026 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4333 event pairs, 149 based on Foata normal form. 7/837 useless extension candidates. Maximal degree in co-relation 2042. Up to 817 conditions per place. [2025-04-13 19:14:32,833 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 54 selfloop transitions, 4 changer transitions 2/60 dead transitions. [2025-04-13 19:14:32,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 365 flow [2025-04-13 19:14:32,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:14:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:14:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-13 19:14:32,837 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2025-04-13 19:14:32,837 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 174 flow. Second operand 4 states and 54 transitions. [2025-04-13 19:14:32,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 365 flow [2025-04-13 19:14:32,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:14:32,844 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 199 flow [2025-04-13 19:14:32,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-04-13 19:14:32,844 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 19:14:32,845 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 199 flow [2025-04-13 19:14:32,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:32,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:32,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:32,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:14:32,845 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:32,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1972722819, now seen corresponding path program 1 times [2025-04-13 19:14:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:32,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778988779] [2025-04-13 19:14:32,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:32,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:32,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:14:32,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:14:32,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:32,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:33,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778988779] [2025-04-13 19:14:33,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778988779] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:33,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012063877] [2025-04-13 19:14:33,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:33,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:33,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:33,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:14:33,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:14:34,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:14:34,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:34,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:34,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1754 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 19:14:34,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:34,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-04-13 19:14:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:14:34,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 19:14:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012063877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:34,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 19:14:34,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-13 19:14:34,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469389161] [2025-04-13 19:14:34,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:34,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:14:34,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:34,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:14:34,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:14:34,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:34,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 199 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 19:14:34,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:34,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:34,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:34,320 INFO L116 PetriNetUnfolderBase]: 612/1081 cut-off events. [2025-04-13 19:14:34,320 INFO L117 PetriNetUnfolderBase]: For 568/568 co-relation queries the response was YES. [2025-04-13 19:14:34,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 1081 events. 612/1081 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4615 event pairs, 134 based on Foata normal form. 7/885 useless extension candidates. Maximal degree in co-relation 2115. Up to 663 conditions per place. [2025-04-13 19:14:34,325 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 41 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2025-04-13 19:14:34,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 321 flow [2025-04-13 19:14:34,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:14:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:14:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 19:14:34,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-04-13 19:14:34,326 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 199 flow. Second operand 3 states and 41 transitions. [2025-04-13 19:14:34,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 321 flow [2025-04-13 19:14:34,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 310 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-13 19:14:34,333 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 220 flow [2025-04-13 19:14:34,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-04-13 19:14:34,334 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 19:14:34,334 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 220 flow [2025-04-13 19:14:34,334 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 19:14:34,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:34,334 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:34,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:14:34,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:34,534 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:34,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1107598658, now seen corresponding path program 1 times [2025-04-13 19:14:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:34,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440787705] [2025-04-13 19:14:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:34,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:14:34,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:14:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:34,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440787705] [2025-04-13 19:14:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440787705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:34,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983592989] [2025-04-13 19:14:34,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:34,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:34,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:34,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:34,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:14:34,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:14:35,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:14:35,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:35,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:35,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1775 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:14:35,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:35,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:35,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:35,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:14:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983592989] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:14:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 10 [2025-04-13 19:14:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288457301] [2025-04-13 19:14:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:35,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:14:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:35,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:14:35,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:14:35,504 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:35,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 19:14:35,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:35,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:35,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:35,725 INFO L116 PetriNetUnfolderBase]: 763/1350 cut-off events. [2025-04-13 19:14:35,725 INFO L117 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2025-04-13 19:14:35,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1350 events. 763/1350 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5968 event pairs, 70 based on Foata normal form. 12/1124 useless extension candidates. Maximal degree in co-relation 2684. Up to 696 conditions per place. [2025-04-13 19:14:35,733 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 50 selfloop transitions, 22 changer transitions 0/72 dead transitions. [2025-04-13 19:14:35,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 482 flow [2025-04-13 19:14:35,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:14:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:14:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-13 19:14:35,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-04-13 19:14:35,734 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 220 flow. Second operand 5 states and 64 transitions. [2025-04-13 19:14:35,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 482 flow [2025-04-13 19:14:35,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 72 transitions, 421 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-04-13 19:14:35,738 INFO L231 Difference]: Finished difference. Result has 40 places, 47 transitions, 299 flow [2025-04-13 19:14:35,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=40, PETRI_TRANSITIONS=47} [2025-04-13 19:14:35,740 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2025-04-13 19:14:35,740 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 47 transitions, 299 flow [2025-04-13 19:14:35,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 19:14:35,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:35,740 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:35,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:14:35,941 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 19:14:35,941 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:35,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1223993312, now seen corresponding path program 1 times [2025-04-13 19:14:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:35,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63391615] [2025-04-13 19:14:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:14:36,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:14:36,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:36,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:36,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:36,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63391615] [2025-04-13 19:14:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63391615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:36,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017551980] [2025-04-13 19:14:36,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:36,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:36,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:36,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:14:37,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:14:37,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:14:37,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:37,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:37,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 19:14:37,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:37,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 19:14:37,343 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-04-13 19:14:37,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-04-13 19:14:37,388 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:14:37,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 31 [2025-04-13 19:14:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:37,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017551980] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:37,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-13 19:14:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991941470] [2025-04-13 19:14:37,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:37,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:14:37,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:37,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:14:37,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:14:37,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:37,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 47 transitions, 299 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:37,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:37,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:37,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:38,426 INFO L116 PetriNetUnfolderBase]: 1236/2194 cut-off events. [2025-04-13 19:14:38,426 INFO L117 PetriNetUnfolderBase]: For 1471/1471 co-relation queries the response was YES. [2025-04-13 19:14:38,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5611 conditions, 2194 events. 1236/2194 cut-off events. For 1471/1471 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 10267 event pairs, 272 based on Foata normal form. 18/1801 useless extension candidates. Maximal degree in co-relation 4581. Up to 537 conditions per place. [2025-04-13 19:14:38,437 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 88 selfloop transitions, 35 changer transitions 8/131 dead transitions. [2025-04-13 19:14:38,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 131 transitions, 872 flow [2025-04-13 19:14:38,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:14:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:14:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2025-04-13 19:14:38,438 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5299145299145299 [2025-04-13 19:14:38,438 INFO L175 Difference]: Start difference. First operand has 40 places, 47 transitions, 299 flow. Second operand 9 states and 124 transitions. [2025-04-13 19:14:38,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 131 transitions, 872 flow [2025-04-13 19:14:38,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 131 transitions, 837 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:14:38,442 INFO L231 Difference]: Finished difference. Result has 52 places, 62 transitions, 533 flow [2025-04-13 19:14:38,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=533, PETRI_PLACES=52, PETRI_TRANSITIONS=62} [2025-04-13 19:14:38,443 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2025-04-13 19:14:38,443 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 62 transitions, 533 flow [2025-04-13 19:14:38,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:38,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:38,443 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-04-13 19:14:38,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:14:38,645 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 19:14:38,645 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:38,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash 193794019, now seen corresponding path program 2 times [2025-04-13 19:14:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:38,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425380509] [2025-04-13 19:14:38,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:38,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 19:14:38,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:14:38,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:38,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:39,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:39,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425380509] [2025-04-13 19:14:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425380509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:39,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252813162] [2025-04-13 19:14:39,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:39,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:39,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:14:39,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 19:14:39,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:14:39,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:39,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:39,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:14:39,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:39,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:39,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:39,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:39,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:39,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252813162] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:39,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:39,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-04-13 19:14:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267041993] [2025-04-13 19:14:39,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:39,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:14:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:39,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:14:39,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:14:39,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:39,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 62 transitions, 533 flow. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 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 19:14:39,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:39,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:39,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:40,514 INFO L116 PetriNetUnfolderBase]: 4487/7834 cut-off events. [2025-04-13 19:14:40,515 INFO L117 PetriNetUnfolderBase]: For 11258/11258 co-relation queries the response was YES. [2025-04-13 19:14:40,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21706 conditions, 7834 events. 4487/7834 cut-off events. For 11258/11258 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 42121 event pairs, 768 based on Foata normal form. 140/6498 useless extension candidates. Maximal degree in co-relation 20027. Up to 1444 conditions per place. [2025-04-13 19:14:40,560 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 317 selfloop transitions, 166 changer transitions 10/493 dead transitions. [2025-04-13 19:14:40,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 493 transitions, 3677 flow [2025-04-13 19:14:40,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 19:14:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 19:14:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 461 transitions. [2025-04-13 19:14:40,562 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.591025641025641 [2025-04-13 19:14:40,562 INFO L175 Difference]: Start difference. First operand has 52 places, 62 transitions, 533 flow. Second operand 30 states and 461 transitions. [2025-04-13 19:14:40,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 493 transitions, 3677 flow [2025-04-13 19:14:40,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 493 transitions, 3641 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-04-13 19:14:40,583 INFO L231 Difference]: Finished difference. Result has 81 places, 200 transitions, 2287 flow [2025-04-13 19:14:40,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2287, PETRI_PLACES=81, PETRI_TRANSITIONS=200} [2025-04-13 19:14:40,583 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 56 predicate places. [2025-04-13 19:14:40,584 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 200 transitions, 2287 flow [2025-04-13 19:14:40,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 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 19:14:40,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:40,584 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:40,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:14:40,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:40,785 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:40,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1825688704, now seen corresponding path program 2 times [2025-04-13 19:14:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:40,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751530884] [2025-04-13 19:14:40,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:40,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 19:14:40,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:14:40,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:40,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:42,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751530884] [2025-04-13 19:14:42,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751530884] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:42,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360395040] [2025-04-13 19:14:42,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:42,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:42,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:42,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:42,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:14:42,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 19:14:42,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:14:42,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:42,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:42,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1815 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 19:14:42,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:42,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 19:14:42,835 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-04-13 19:14:42,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-04-13 19:14:42,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-04-13 19:14:42,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 95 [2025-04-13 19:14:42,965 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:14:42,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2025-04-13 19:14:42,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2025-04-13 19:14:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:43,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360395040] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:44,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-04-13 19:14:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505222778] [2025-04-13 19:14:44,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:44,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 19:14:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:44,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 19:14:44,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-04-13 19:14:44,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:44,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 200 transitions, 2287 flow. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:44,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:44,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:44,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:47,050 INFO L116 PetriNetUnfolderBase]: 7465/13123 cut-off events. [2025-04-13 19:14:47,050 INFO L117 PetriNetUnfolderBase]: For 25060/25060 co-relation queries the response was YES. [2025-04-13 19:14:47,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37444 conditions, 13123 events. 7465/13123 cut-off events. For 25060/25060 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 79880 event pairs, 1415 based on Foata normal form. 133/10697 useless extension candidates. Maximal degree in co-relation 35729. Up to 3132 conditions per place. [2025-04-13 19:14:47,192 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 213 selfloop transitions, 231 changer transitions 24/468 dead transitions. [2025-04-13 19:14:47,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 468 transitions, 4914 flow [2025-04-13 19:14:47,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 19:14:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 19:14:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 262 transitions. [2025-04-13 19:14:47,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5038461538461538 [2025-04-13 19:14:47,194 INFO L175 Difference]: Start difference. First operand has 81 places, 200 transitions, 2287 flow. Second operand 20 states and 262 transitions. [2025-04-13 19:14:47,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 468 transitions, 4914 flow [2025-04-13 19:14:47,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 468 transitions, 4423 flow, removed 203 selfloop flow, removed 6 redundant places. [2025-04-13 19:14:47,235 INFO L231 Difference]: Finished difference. Result has 101 places, 302 transitions, 3922 flow [2025-04-13 19:14:47,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3922, PETRI_PLACES=101, PETRI_TRANSITIONS=302} [2025-04-13 19:14:47,236 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 76 predicate places. [2025-04-13 19:14:47,236 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 302 transitions, 3922 flow [2025-04-13 19:14:47,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:47,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:47,236 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:47,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 19:14:47,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:47,437 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:47,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2014244554, now seen corresponding path program 1 times [2025-04-13 19:14:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:47,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561573557] [2025-04-13 19:14:47,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:47,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:14:47,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:14:47,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:47,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:14:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:48,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561573557] [2025-04-13 19:14:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561573557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:48,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024224680] [2025-04-13 19:14:48,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:48,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:48,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:48,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:48,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:14:48,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:14:48,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:14:48,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:48,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:48,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1868 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 19:14:48,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:48,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:48,344 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:48,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:48,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:48,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:14:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:48,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 19:14:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024224680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:48,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 19 [2025-04-13 19:14:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082695111] [2025-04-13 19:14:48,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:48,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 19:14:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:48,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 19:14:48,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-04-13 19:14:48,657 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:48,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 302 transitions, 3922 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:48,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:48,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:48,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:51,476 INFO L116 PetriNetUnfolderBase]: 12861/22599 cut-off events. [2025-04-13 19:14:51,476 INFO L117 PetriNetUnfolderBase]: For 51945/51945 co-relation queries the response was YES. [2025-04-13 19:14:51,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65985 conditions, 22599 events. 12861/22599 cut-off events. For 51945/51945 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 144954 event pairs, 2744 based on Foata normal form. 276/18256 useless extension candidates. Maximal degree in co-relation 64672. Up to 4279 conditions per place. [2025-04-13 19:14:51,628 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 216 selfloop transitions, 466 changer transitions 2/684 dead transitions. [2025-04-13 19:14:51,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 684 transitions, 8431 flow [2025-04-13 19:14:51,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:14:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 19:14:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 269 transitions. [2025-04-13 19:14:51,630 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5747863247863247 [2025-04-13 19:14:51,630 INFO L175 Difference]: Start difference. First operand has 101 places, 302 transitions, 3922 flow. Second operand 18 states and 269 transitions. [2025-04-13 19:14:51,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 684 transitions, 8431 flow [2025-04-13 19:14:51,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 684 transitions, 8348 flow, removed 37 selfloop flow, removed 2 redundant places. [2025-04-13 19:14:51,716 INFO L231 Difference]: Finished difference. Result has 122 places, 520 transitions, 7928 flow [2025-04-13 19:14:51,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=3839, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7928, PETRI_PLACES=122, PETRI_TRANSITIONS=520} [2025-04-13 19:14:51,717 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 97 predicate places. [2025-04-13 19:14:51,717 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 520 transitions, 7928 flow [2025-04-13 19:14:51,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:51,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:51,717 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:51,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:14:51,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:51,918 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:51,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1905189408, now seen corresponding path program 3 times [2025-04-13 19:14:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:51,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977654922] [2025-04-13 19:14:51,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:14:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:51,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 19:14:52,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:14:52,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:14:52,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:14:53,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:53,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977654922] [2025-04-13 19:14:53,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977654922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:53,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025053788] [2025-04-13 19:14:53,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:14:53,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:53,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:53,956 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:53,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:14:54,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 19:14:54,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:14:54,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:14:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:54,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 19:14:54,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:54,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 19:14:54,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-04-13 19:14:54,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2025-04-13 19:14:54,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-13 19:14:54,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2025-04-13 19:14:54,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2025-04-13 19:14:54,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2025-04-13 19:14:54,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 103 [2025-04-13 19:14:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:55,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025053788] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:56,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-04-13 19:14:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787832281] [2025-04-13 19:14:56,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:56,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 19:14:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:56,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 19:14:56,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-04-13 19:14:56,447 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:56,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 520 transitions, 7928 flow. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 22 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:56,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:56,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:56,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:01,762 INFO L116 PetriNetUnfolderBase]: 20803/36715 cut-off events. [2025-04-13 19:15:01,763 INFO L117 PetriNetUnfolderBase]: For 121681/121681 co-relation queries the response was YES. [2025-04-13 19:15:01,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113646 conditions, 36715 events. 20803/36715 cut-off events. For 121681/121681 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 258868 event pairs, 4442 based on Foata normal form. 49/29337 useless extension candidates. Maximal degree in co-relation 111660. Up to 9125 conditions per place. [2025-04-13 19:15:02,015 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 270 selfloop transitions, 687 changer transitions 26/983 dead transitions. [2025-04-13 19:15:02,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 983 transitions, 15087 flow [2025-04-13 19:15:02,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:15:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:15:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 286 transitions. [2025-04-13 19:15:02,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:15:02,023 INFO L175 Difference]: Start difference. First operand has 122 places, 520 transitions, 7928 flow. Second operand 22 states and 286 transitions. [2025-04-13 19:15:02,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 983 transitions, 15087 flow [2025-04-13 19:15:02,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 983 transitions, 13834 flow, removed 131 selfloop flow, removed 6 redundant places. [2025-04-13 19:15:02,333 INFO L231 Difference]: Finished difference. Result has 141 places, 793 transitions, 13683 flow [2025-04-13 19:15:02,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6963, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=419, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=13683, PETRI_PLACES=141, PETRI_TRANSITIONS=793} [2025-04-13 19:15:02,336 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 116 predicate places. [2025-04-13 19:15:02,336 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 793 transitions, 13683 flow [2025-04-13 19:15:02,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 22 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:15:02,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:02,337 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:02,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 19:15:02,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 19:15:02,537 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:15:02,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash 588195286, now seen corresponding path program 2 times [2025-04-13 19:15:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:02,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048352823] [2025-04-13 19:15:02,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:02,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:02,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 19:15:02,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 19:15:02,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:15:02,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:03,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048352823] [2025-04-13 19:15:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048352823] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:03,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237483638] [2025-04-13 19:15:03,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:03,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:03,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:03,531 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:15:03,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 19:15:03,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 19:15:03,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 19:15:03,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:15:03,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:03,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1918 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 19:15:03,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:03,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:15:03,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:15:03,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:15:03,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:15:03,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:15:03,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:15:04,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-04-13 19:15:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:15:04,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:15:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237483638] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:04,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 5] total 22 [2025-04-13 19:15:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756611514] [2025-04-13 19:15:04,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:04,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 19:15:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:04,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 19:15:04,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-04-13 19:15:04,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:15:04,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 793 transitions, 13683 flow. Second operand has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:15:04,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:04,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:15:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:12,836 INFO L116 PetriNetUnfolderBase]: 30673/54140 cut-off events. [2025-04-13 19:15:12,836 INFO L117 PetriNetUnfolderBase]: For 228102/228102 co-relation queries the response was YES. [2025-04-13 19:15:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173448 conditions, 54140 events. 30673/54140 cut-off events. For 228102/228102 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 402450 event pairs, 6756 based on Foata normal form. 504/43592 useless extension candidates. Maximal degree in co-relation 171187. Up to 10369 conditions per place. [2025-04-13 19:15:13,194 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 278 selfloop transitions, 1105 changer transitions 2/1385 dead transitions. [2025-04-13 19:15:13,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 1385 transitions, 23535 flow [2025-04-13 19:15:13,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:15:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:15:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 326 transitions. [2025-04-13 19:15:13,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5699300699300699 [2025-04-13 19:15:13,198 INFO L175 Difference]: Start difference. First operand has 141 places, 793 transitions, 13683 flow. Second operand 22 states and 326 transitions. [2025-04-13 19:15:13,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 1385 transitions, 23535 flow [2025-04-13 19:15:13,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 1385 transitions, 23349 flow, removed 93 selfloop flow, removed 0 redundant places. [2025-04-13 19:15:13,721 INFO L231 Difference]: Finished difference. Result has 164 places, 1182 transitions, 22616 flow [2025-04-13 19:15:13,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=13488, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=744, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=22616, PETRI_PLACES=164, PETRI_TRANSITIONS=1182} [2025-04-13 19:15:13,725 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 139 predicate places. [2025-04-13 19:15:13,725 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 1182 transitions, 22616 flow [2025-04-13 19:15:13,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:15:13,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:13,729 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:13,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 19:15:13,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:13,930 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:15:13,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1982477248, now seen corresponding path program 4 times [2025-04-13 19:15:13,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:13,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042143967] [2025-04-13 19:15:13,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:15:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:13,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 19:15:14,075 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 19:15:14,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:15:14,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:15:15,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:15,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042143967] [2025-04-13 19:15:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042143967] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:15,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356881098] [2025-04-13 19:15:15,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:15:15,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:15,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:15,947 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:15:15,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 19:15:16,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 19:15:16,223 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 19:15:16,223 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:15:16,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:16,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 19:15:16,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:16,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 19:15:16,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2025-04-13 19:15:16,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 90 [2025-04-13 19:15:16,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 32 [2025-04-13 19:15:16,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 131 [2025-04-13 19:15:16,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:15:16,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 135 [2025-04-13 19:15:16,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 99 [2025-04-13 19:15:17,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 265 [2025-04-13 19:15:17,025 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:15:17,025 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 205 [2025-04-13 19:15:17,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 151 [2025-04-13 19:15:18,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 635 treesize of output 535 [2025-04-13 19:15:18,287 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:15:18,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 535 treesize of output 329 [2025-04-13 19:15:18,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 595 treesize of output 486 [2025-04-13 19:15:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:15:28,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:15:29,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356881098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:29,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:29,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-04-13 19:15:29,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012306237] [2025-04-13 19:15:29,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:29,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 19:15:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:29,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 19:15:29,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-04-13 19:15:29,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:15:29,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 1182 transitions, 22616 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:15:29,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:29,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:15:29,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:03,849 INFO L116 PetriNetUnfolderBase]: 78871/139568 cut-off events. [2025-04-13 19:16:03,849 INFO L117 PetriNetUnfolderBase]: For 696887/696887 co-relation queries the response was YES. [2025-04-13 19:16:04,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462833 conditions, 139568 events. 78871/139568 cut-off events. For 696887/696887 co-relation queries the response was YES. Maximal size of possible extension queue 1713. Compared 1192296 event pairs, 16120 based on Foata normal form. 54/111209 useless extension candidates. Maximal degree in co-relation 460484. Up to 26950 conditions per place. [2025-04-13 19:16:04,942 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 606 selfloop transitions, 2873 changer transitions 52/3531 dead transitions. [2025-04-13 19:16:04,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 3531 transitions, 65829 flow [2025-04-13 19:16:04,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 19:16:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2025-04-13 19:16:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 846 transitions. [2025-04-13 19:16:04,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47157190635451507 [2025-04-13 19:16:04,946 INFO L175 Difference]: Start difference. First operand has 164 places, 1182 transitions, 22616 flow. Second operand 69 states and 846 transitions. [2025-04-13 19:16:04,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 3531 transitions, 65829 flow [2025-04-13 19:16:06,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 3531 transitions, 63032 flow, removed 213 selfloop flow, removed 6 redundant places. [2025-04-13 19:16:06,745 INFO L231 Difference]: Finished difference. Result has 234 places, 2968 transitions, 62754 flow [2025-04-13 19:16:06,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=21539, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=62754, PETRI_PLACES=234, PETRI_TRANSITIONS=2968} [2025-04-13 19:16:06,746 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 209 predicate places. [2025-04-13 19:16:06,746 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 2968 transitions, 62754 flow [2025-04-13 19:16:06,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:06,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:06,747 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2025-04-13 19:16:06,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 19:16:06,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 19:16:06,948 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:16:06,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1035705781, now seen corresponding path program 3 times [2025-04-13 19:16:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:06,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488031217] [2025-04-13 19:16:06,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:06,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 19:16:07,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 19:16:07,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 19:16:07,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:07,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488031217] [2025-04-13 19:16:07,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488031217] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:07,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916043370] [2025-04-13 19:16:07,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:16:07,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:07,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:07,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:07,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 19:16:07,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 19:16:08,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 19:16:08,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 19:16:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:08,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 19:16:08,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:08,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,671 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:16:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:08,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916043370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:08,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:08,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2025-04-13 19:16:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038331990] [2025-04-13 19:16:08,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:08,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 19:16:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:08,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 19:16:08,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 19:16:08,988 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:16:08,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 2968 transitions, 62754 flow. Second operand has 35 states, 35 states have (on average 5.857142857142857) internal successors, (205), 35 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:08,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:08,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:16:08,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:18:50,387 INFO L116 PetriNetUnfolderBase]: 240490/420982 cut-off events. [2025-04-13 19:18:50,387 INFO L117 PetriNetUnfolderBase]: For 2804929/2804929 co-relation queries the response was YES. [2025-04-13 19:18:52,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502846 conditions, 420982 events. 240490/420982 cut-off events. For 2804929/2804929 co-relation queries the response was YES. Maximal size of possible extension queue 2607. Compared 3879545 event pairs, 59929 based on Foata normal form. 2713/338525 useless extension candidates. Maximal degree in co-relation 1498843. Up to 80080 conditions per place. [2025-04-13 19:18:54,010 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 1282 selfloop transitions, 9267 changer transitions 22/10571 dead transitions. [2025-04-13 19:18:54,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 10571 transitions, 226998 flow [2025-04-13 19:18:54,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 19:18:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-13 19:18:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1519 transitions. [2025-04-13 19:18:54,014 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5901320901320901 [2025-04-13 19:18:54,014 INFO L175 Difference]: Start difference. First operand has 234 places, 2968 transitions, 62754 flow. Second operand 99 states and 1519 transitions. [2025-04-13 19:18:54,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 10571 transitions, 226998 flow [2025-04-13 19:20:08,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 10571 transitions, 224029 flow, removed 1484 selfloop flow, removed 1 redundant places. [2025-04-13 19:20:08,783 INFO L231 Difference]: Finished difference. Result has 331 places, 9576 transitions, 219356 flow [2025-04-13 19:20:08,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=61490, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2842, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=219356, PETRI_PLACES=331, PETRI_TRANSITIONS=9576} [2025-04-13 19:20:08,787 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 306 predicate places. [2025-04-13 19:20:08,787 INFO L485 AbstractCegarLoop]: Abstraction has has 331 places, 9576 transitions, 219356 flow [2025-04-13 19:20:08,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.857142857142857) internal successors, (205), 35 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:20:08,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:20:08,788 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:20:08,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 19:20:08,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 19:20:08,988 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:20:08,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:20:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1347659872, now seen corresponding path program 5 times [2025-04-13 19:20:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:20:08,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404135755] [2025-04-13 19:20:08,993 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:20:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:20:09,039 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 19:20:09,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 19:20:09,461 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 19:20:09,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:20:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:20:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:20:12,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404135755] [2025-04-13 19:20:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404135755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:20:12,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968936914] [2025-04-13 19:20:12,439 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:20:12,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:20:12,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:20:12,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:20:12,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 19:20:12,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 19:20:13,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 19:20:13,037 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 19:20:13,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:20:13,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1944 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 19:20:13,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:20:13,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 19:20:13,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-04-13 19:20:13,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2025-04-13 19:20:13,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-04-13 19:20:13,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2025-04-13 19:20:13,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2025-04-13 19:20:13,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2025-04-13 19:20:13,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 103 [2025-04-13 19:20:13,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 167 [2025-04-13 19:20:13,917 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 175 [2025-04-13 19:20:14,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 112 [2025-04-13 19:20:14,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 325 [2025-04-13 19:20:14,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 291 [2025-04-13 19:20:14,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 258 [2025-04-13 19:20:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:20:25,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:20:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:20:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968936914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:20:27,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:20:27,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2025-04-13 19:20:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868044157] [2025-04-13 19:20:27,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:20:27,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 19:20:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:20:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 19:20:27,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2025-04-13 19:20:27,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:20:27,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 9576 transitions, 219356 flow. Second operand has 31 states, 31 states have (on average 6.580645161290323) internal successors, (204), 31 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:20:27,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:20:27,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:20:27,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 19:25:11,337 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:25:11,338 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:25:12,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 19:25:12,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2025-04-13 19:25:13,161 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:25:13,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:25:13,162 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 19:25:13,165 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 19:25:13,165 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:25:13,165 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:25:13,165 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:25:13,165 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:25:13,165 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2025-04-13 19:25:13,173 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:25:13,173 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:25:13,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:25:13 BasicIcfg [2025-04-13 19:25:13,176 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:25:13,176 INFO L158 Benchmark]: Toolchain (without parser) took 657697.37ms. Allocated memory was 142.6MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 98.7MB in the beginning and 836.8MB in the end (delta: -738.0MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2025-04-13 19:25:13,177 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:25:13,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.14ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 56.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 19:25:13,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.08ms. Allocated memory is still 142.6MB. Free memory was 56.8MB in the beginning and 47.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 19:25:13,177 INFO L158 Benchmark]: Boogie Preprocessor took 108.82ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 40.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 19:25:13,177 INFO L158 Benchmark]: RCFGBuilder took 11985.69ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 40.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-04-13 19:25:13,177 INFO L158 Benchmark]: TraceAbstraction took 645024.38ms. Allocated memory was 3.1GB in the beginning and 5.0GB in the end (delta: 1.8GB). Free memory was 2.0GB in the beginning and 836.8MB in the end (delta: 1.1GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2025-04-13 19:25:13,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 492.14ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 56.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.08ms. Allocated memory is still 142.6MB. Free memory was 56.8MB in the beginning and 47.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 108.82ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 40.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 11985.69ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 40.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * TraceAbstraction took 645024.38ms. Allocated memory was 3.1GB in the beginning and 5.0GB in the end (delta: 1.8GB). Free memory was 2.0GB in the beginning and 836.8MB in the end (delta: 1.1GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 46 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 644.9s, OverallIterations: 15, TraceHistogramMax: 11, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 586.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6752 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6752 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12244 IncrementalHoareTripleChecker+Invalid, 13414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1170 mSolverCounterUnsat, 0 mSDtfsCounter, 12244 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1088 GetRequests, 666 SyntacticMatches, 3 SemanticMatches, 419 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8565 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219356occurred in iteration=14, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 49.2s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 1059 ConstructedInterpolants, 21 QuantifiedInterpolants, 71937 SizeOfPredicates, 150 NumberOfNonLiveVariables, 22041 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 157/1950 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown