/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/stack_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:47:42,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:47:42,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:47:42,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:47:42,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:47:42,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:47:42,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:47:42,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:47:42,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:47:42,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:47:42,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:47:42,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:47:42,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:47:42,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:47:42,974 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:47:42,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:47:42,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:47:42,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:42,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:42,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:47:42,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:47:42,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:47:42,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:47:42,977 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:47:43,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:47:43,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:47:43,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:47:43,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:47:43,206 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:47:43,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2025-04-13 23:47:44,532 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12579d65/41611e06077d4f7fa831a3aecf366631/FLAG126cf2460 [2025-04-13 23:47:44,799 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:47:44,800 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2025-04-13 23:47:44,814 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12579d65/41611e06077d4f7fa831a3aecf366631/FLAG126cf2460 [2025-04-13 23:47:45,733 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12579d65/41611e06077d4f7fa831a3aecf366631 [2025-04-13 23:47:45,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:47:45,736 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:47:45,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:47:45,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:47:45,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:47:45,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:47:45" (1/1) ... [2025-04-13 23:47:45,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281ebc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:45, skipping insertion in model container [2025-04-13 23:47:45,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:47:45" (1/1) ... [2025-04-13 23:47:45,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:47:46,059 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_longer-1.i[41527,41540] [2025-04-13 23:47:46,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:47:46,106 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:47:46,174 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_longer-1.i[41527,41540] [2025-04-13 23:47:46,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:47:46,266 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:47:46,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46 WrapperNode [2025-04-13 23:47:46,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:47:46,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:47:46,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:47:46,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:47:46,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,350 INFO L138 Inliner]: procedures = 277, calls = 431, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 546 [2025-04-13 23:47:46,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:47:46,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:47:46,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:47:46,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:47:46,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,402 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 402, 5]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 400, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-04-13 23:47:46,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:47:46,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:47:46,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:47:46,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:47:46,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (1/1) ... [2025-04-13 23:47:46,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:47:46,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:47:46,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:47:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:47:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:47:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:47:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:47:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:47:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:47:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:47:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:47:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:47:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:47:46,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:47:46,482 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:47:46,587 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:47:46,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:47:47,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem38#1; [2025-04-13 23:47:47,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret37#1; [2025-04-13 23:47:47,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0; [2025-04-13 23:47:47,184 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:47:47,185 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:47:47,185 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:47:50,413 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:47:50,415 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:47:50,417 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:47:50,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:47:50 BoogieIcfgContainer [2025-04-13 23:47:50,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:47:50,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:47:50,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:47:50,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:47:50,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:47:45" (1/3) ... [2025-04-13 23:47:50,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec20bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:47:50, skipping insertion in model container [2025-04-13 23:47:50,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:46" (2/3) ... [2025-04-13 23:47:50,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec20bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:47:50, skipping insertion in model container [2025-04-13 23:47:50,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:47:50" (3/3) ... [2025-04-13 23:47:50,426 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-04-13 23:47:50,437 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:47:50,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 23:47:50,438 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:47:50,493 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:47:50,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 23:47:50,633 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-13 23:47:50,635 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:47:50,636 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 40 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 23:47:50,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 23:47:50,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 53 flow [2025-04-13 23:47:50,645 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:47:50,658 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;@7d2fdf9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:47:50,658 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:47:50,674 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:47:50,674 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 23:47:50,674 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:47:50,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:50,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:47:50,675 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 23:47:50,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1103465618, now seen corresponding path program 1 times [2025-04-13 23:47:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:50,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849235316] [2025-04-13 23:47:50,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:47:50,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:47:50,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:50,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:51,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849235316] [2025-04-13 23:47:51,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849235316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:51,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:51,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:47:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268537248] [2025-04-13 23:47:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:51,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:47:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:51,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:47:51,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:47:51,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:51,236 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 23:47:51,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:51,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:51,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:51,408 INFO L116 PetriNetUnfolderBase]: 215/367 cut-off events. [2025-04-13 23:47:51,408 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 23:47:51,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 367 events. 215/367 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1254 event pairs, 48 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 720. Up to 265 conditions per place. [2025-04-13 23:47:51,416 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-04-13 23:47:51,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 140 flow [2025-04-13 23:47:51,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:47:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:47:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 23:47:51,428 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 23:47:51,429 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 53 flow. Second operand 3 states and 42 transitions. [2025-04-13 23:47:51,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 140 flow [2025-04-13 23:47:51,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 23:47:51,436 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 56 flow [2025-04-13 23:47:51,438 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=56, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 23:47:51,439 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 23:47:51,440 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 56 flow [2025-04-13 23:47:51,440 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 23:47:51,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:51,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:51,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:47:51,440 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:51,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash -439827334, now seen corresponding path program 1 times [2025-04-13 23:47:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:51,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755340132] [2025-04-13 23:47:51,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:51,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:47:51,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:47:51,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:51,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:51,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755340132] [2025-04-13 23:47:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755340132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:47:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342681814] [2025-04-13 23:47:51,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:51,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:47:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:51,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:47:51,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:47:51,635 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:51,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:51,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:51,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:51,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:51,754 INFO L116 PetriNetUnfolderBase]: 206/352 cut-off events. [2025-04-13 23:47:51,754 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-13 23:47:51,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 352 events. 206/352 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1185 event pairs, 52 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 620. Up to 263 conditions per place. [2025-04-13 23:47:51,758 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-13 23:47:51,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 140 flow [2025-04-13 23:47:51,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:47:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:47:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 23:47:51,759 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 23:47:51,759 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 56 flow. Second operand 3 states and 38 transitions. [2025-04-13 23:47:51,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 140 flow [2025-04-13 23:47:51,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:47:51,760 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 62 flow [2025-04-13 23:47:51,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2025-04-13 23:47:51,762 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2025-04-13 23:47:51,762 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 62 flow [2025-04-13 23:47:51,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:51,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:51,763 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:51,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:47:51,763 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:51,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1772867979, now seen corresponding path program 1 times [2025-04-13 23:47:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:51,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624999169] [2025-04-13 23:47:51,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:51,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:47:51,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:47:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:52,012 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 23:47:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:52,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624999169] [2025-04-13 23:47:52,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624999169] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:47:52,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159842592] [2025-04-13 23:47:52,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:52,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:47:52,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:47:52,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:47:52,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:47:52,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:47:52,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:47:52,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:52,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:47:52,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:47:52,300 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 23:47:52,336 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 23:47:52,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:47:52,371 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 23:47:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159842592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:47:52,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:47:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-04-13 23:47:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131570323] [2025-04-13 23:47:52,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:47:52,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:47:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:52,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:47:52,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:47:52,372 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:52,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:52,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:52,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:52,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:52,662 INFO L116 PetriNetUnfolderBase]: 691/1187 cut-off events. [2025-04-13 23:47:52,663 INFO L117 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-04-13 23:47:52,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 1187 events. 691/1187 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4992 event pairs, 49 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 2309. Up to 281 conditions per place. [2025-04-13 23:47:52,674 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 87 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2025-04-13 23:47:52,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 103 transitions, 467 flow [2025-04-13 23:47:52,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:47:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:47:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2025-04-13 23:47:52,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5913461538461539 [2025-04-13 23:47:52,675 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 62 flow. Second operand 8 states and 123 transitions. [2025-04-13 23:47:52,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 103 transitions, 467 flow [2025-04-13 23:47:52,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 103 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:47:52,681 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 181 flow [2025-04-13 23:47:52,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, 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=181, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2025-04-13 23:47:52,682 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-13 23:47:52,682 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 181 flow [2025-04-13 23:47:52,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:52,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:52,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:52,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:47:52,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:47:52,883 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 23:47:52,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -902214253, now seen corresponding path program 1 times [2025-04-13 23:47:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:52,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818669820] [2025-04-13 23:47:52,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:52,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:47:52,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:47:52,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:52,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:53,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818669820] [2025-04-13 23:47:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818669820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:47:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713170278] [2025-04-13 23:47:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:53,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:47:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:53,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:47:53,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:47:53,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:53,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 181 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 23:47:53,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:53,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:53,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:53,337 INFO L116 PetriNetUnfolderBase]: 486/855 cut-off events. [2025-04-13 23:47:53,337 INFO L117 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2025-04-13 23:47:53,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 855 events. 486/855 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3543 event pairs, 173 based on Foata normal form. 48/764 useless extension candidates. Maximal degree in co-relation 2018. Up to 464 conditions per place. [2025-04-13 23:47:53,342 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 41 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-04-13 23:47:53,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 286 flow [2025-04-13 23:47:53,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:47:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:47:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 23:47:53,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 23:47:53,344 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 181 flow. Second operand 3 states and 38 transitions. [2025-04-13 23:47:53,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 286 flow [2025-04-13 23:47:53,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 259 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-04-13 23:47:53,351 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 154 flow [2025-04-13 23:47:53,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-04-13 23:47:53,354 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2025-04-13 23:47:53,354 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 154 flow [2025-04-13 23:47:53,354 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 23:47:53,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:53,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:53,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:47:53,354 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 23:47:53,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2092291161, now seen corresponding path program 1 times [2025-04-13 23:47:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:53,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103876228] [2025-04-13 23:47:53,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:53,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:47:53,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:47:53,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:54,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:54,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103876228] [2025-04-13 23:47:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103876228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:54,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:54,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:47:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304681184] [2025-04-13 23:47:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:54,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:47:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:54,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:47:54,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:47:54,204 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:54,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 154 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 23:47:54,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:54,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:54,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:54,367 INFO L116 PetriNetUnfolderBase]: 478/840 cut-off events. [2025-04-13 23:47:54,368 INFO L117 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-04-13 23:47:54,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2153 conditions, 840 events. 478/840 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3289 event pairs, 128 based on Foata normal form. 7/689 useless extension candidates. Maximal degree in co-relation 1792. Up to 631 conditions per place. [2025-04-13 23:47:54,372 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 51 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-04-13 23:47:54,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 318 flow [2025-04-13 23:47:54,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:47:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:47:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-13 23:47:54,373 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2025-04-13 23:47:54,373 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 154 flow. Second operand 4 states and 54 transitions. [2025-04-13 23:47:54,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 318 flow [2025-04-13 23:47:54,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 55 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:47:54,375 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 153 flow [2025-04-13 23:47:54,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-04-13 23:47:54,376 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-13 23:47:54,376 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 153 flow [2025-04-13 23:47:54,376 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 23:47:54,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:54,376 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:54,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:47:54,376 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:54,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash 265966456, now seen corresponding path program 1 times [2025-04-13 23:47:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:54,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945234257] [2025-04-13 23:47:54,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:54,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:47:54,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:47:54,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:54,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:55,047 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 23:47:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:55,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945234257] [2025-04-13 23:47:55,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945234257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:47:55,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753450384] [2025-04-13 23:47:55,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:55,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:47:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:47:55,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:47:55,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:47:55,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:47:55,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:47:55,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:55,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:55,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:47:55,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:47:55,265 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 23:47:55,341 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 23:47:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:55,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:47:55,527 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 23:47:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753450384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:47:55,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:47:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-04-13 23:47:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232083761] [2025-04-13 23:47:55,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:47:55,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:47:55,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:55,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:47:55,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:47:55,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:55,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 153 flow. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:55,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:55,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:55,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:55,947 INFO L116 PetriNetUnfolderBase]: 679/1201 cut-off events. [2025-04-13 23:47:55,947 INFO L117 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2025-04-13 23:47:55,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 1201 events. 679/1201 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5035 event pairs, 104 based on Foata normal form. 14/969 useless extension candidates. Maximal degree in co-relation 2554. Up to 362 conditions per place. [2025-04-13 23:47:55,954 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 78 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2025-04-13 23:47:55,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 93 transitions, 507 flow [2025-04-13 23:47:55,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:47:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:47:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-04-13 23:47:55,956 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4855769230769231 [2025-04-13 23:47:55,956 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 153 flow. Second operand 8 states and 101 transitions. [2025-04-13 23:47:55,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 93 transitions, 507 flow [2025-04-13 23:47:55,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 499 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 23:47:55,959 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 238 flow [2025-04-13 23:47:55,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2025-04-13 23:47:55,960 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2025-04-13 23:47:55,960 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 238 flow [2025-04-13 23:47:55,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:55,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:55,960 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:55,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 23:47:56,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 23:47:56,164 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 23:47:56,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 389995038, now seen corresponding path program 1 times [2025-04-13 23:47:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:56,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482170507] [2025-04-13 23:47:56,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:56,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:47:56,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:47:56,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:56,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:47:56,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:47:56,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:47:56,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:47:56,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:56,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:47:56,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:47:56,403 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:47:56,404 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 23:47:56,405 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 23:47:56,405 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 23:47:56,405 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:47:56,405 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:47:56,405 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:47:56,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:47:56,406 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:56,463 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:47:56,463 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:47:56,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:47:56 BasicIcfg [2025-04-13 23:47:56,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:47:56,470 INFO L158 Benchmark]: Toolchain (without parser) took 10733.47ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 105.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-13 23:47:56,470 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:47:56,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.16ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 68.8MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 23:47:56,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.13ms. Allocated memory is still 155.2MB. Free memory was 68.8MB in the beginning and 62.9MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:47:56,471 INFO L158 Benchmark]: Boogie Preprocessor took 80.60ms. Allocated memory is still 155.2MB. Free memory was 62.9MB in the beginning and 58.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 23:47:56,471 INFO L158 Benchmark]: IcfgBuilder took 3982.55ms. Allocated memory was 155.2MB in the beginning and 805.3MB in the end (delta: 650.1MB). Free memory was 58.1MB in the beginning and 285.2MB in the end (delta: -227.1MB). Peak memory consumption was 463.5MB. Max. memory is 8.0GB. [2025-04-13 23:47:56,471 INFO L158 Benchmark]: TraceAbstraction took 6048.78ms. Allocated memory was 805.3MB in the beginning and 1.8GB in the end (delta: 973.1MB). Free memory was 285.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 632.8MB. Max. memory is 8.0GB. [2025-04-13 23:47:56,472 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.18ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 530.16ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 68.8MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.13ms. Allocated memory is still 155.2MB. Free memory was 68.8MB in the beginning and 62.9MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.60ms. Allocated memory is still 155.2MB. Free memory was 62.9MB in the beginning and 58.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * IcfgBuilder took 3982.55ms. Allocated memory was 155.2MB in the beginning and 805.3MB in the end (delta: 650.1MB). Free memory was 58.1MB in the beginning and 285.2MB in the end (delta: -227.1MB). Peak memory consumption was 463.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6048.78ms. Allocated memory was 805.3MB in the beginning and 1.8GB in the end (delta: 973.1MB). Free memory was 285.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 632.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 940]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-2, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 [L990] COND TRUE 1 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-2, id2=-1, m={4:0}, top=0] [L1004] 2 int i; [L1005] 2 i=0 [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=5, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 940]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 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: 5.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 0 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=6, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1874 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 1/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 23:47:56,485 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 Received shutdown request...