/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 FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:29:33,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:29:33,869 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:29:33,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:29:33,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:29:33,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:29:33,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:29:33,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:29:33,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:29:33,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:29:33,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:29:33,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:29:33,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:29:33,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:29:33,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:29:33,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:29:33,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:29:33,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:29:33,900 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 -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:29:34,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:29:34,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:29:34,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:29:34,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:29:34,125 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:29:34,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-04-13 23:29:35,496 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c449842/0dddd655d51a42308822c1972d891719/FLAG0dea1b667 [2025-04-13 23:29:35,754 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:29:35,754 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-04-13 23:29:35,770 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c449842/0dddd655d51a42308822c1972d891719/FLAG0dea1b667 [2025-04-13 23:29:36,498 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c449842/0dddd655d51a42308822c1972d891719 [2025-04-13 23:29:36,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:29:36,501 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:29:36,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:29:36,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:29:36,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:29:36,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76684999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36, skipping insertion in model container [2025-04-13 23:29:36,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:29:36,809 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-deagle/circular_buffer_ok.i[30451,30464] [2025-04-13 23:29:36,820 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-deagle/circular_buffer_ok.i[30681,30694] [2025-04-13 23:29:36,827 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-deagle/circular_buffer_ok.i[30979,30992] [2025-04-13 23:29:36,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:29:36,847 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:29:36,886 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-deagle/circular_buffer_ok.i[30451,30464] [2025-04-13 23:29:36,888 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-deagle/circular_buffer_ok.i[30681,30694] [2025-04-13 23:29:36,889 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-deagle/circular_buffer_ok.i[30979,30992] [2025-04-13 23:29:36,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:29:36,918 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:29:36,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36 WrapperNode [2025-04-13 23:29:36,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:29:36,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:29:36,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:29:36,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:29:36,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,933 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:29:36" (1/1) ... [2025-04-13 23:29:36,958 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2025-04-13 23:29:36,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:29:36,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:29:36,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:29:36,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:29:36,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,984 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-04-13 23:29:36,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:29:36,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:29:36,995 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:29:36,995 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:29:36,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (1/1) ... [2025-04-13 23:29:36,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:29:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:29:37,021 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:29:37,023 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:29:37,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:29:37,038 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:29:37,038 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 23:29:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 23:29:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:29:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:29:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:29:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 23:29:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:29:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:29:37,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:29:37,040 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:29:37,133 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:29:37,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:29:37,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-04-13 23:29:37,304 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:29:37,304 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:29:37,304 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:29:37,590 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:29:37,591 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:29:37,594 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:29:37,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:29:37 BoogieIcfgContainer [2025-04-13 23:29:37,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:29:37,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:29:37,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:29:37,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:29:37,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:29:36" (1/3) ... [2025-04-13 23:29:37,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163d0eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:29:37, skipping insertion in model container [2025-04-13 23:29:37,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:29:36" (2/3) ... [2025-04-13 23:29:37,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163d0eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:29:37, skipping insertion in model container [2025-04-13 23:29:37,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:29:37" (3/3) ... [2025-04-13 23:29:37,603 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-04-13 23:29:37,613 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:29:37,615 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 24 locations, 25 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-13 23:29:37,615 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:29:37,661 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:29:37,685 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 27 transitions, 68 flow [2025-04-13 23:29:37,708 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 134 states, 129 states have (on average 2.705426356589147) internal successors, (349), 133 states have internal predecessors, (349), 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:29:37,732 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:29:37,742 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=FINITE_AUTOMATA, 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;@74cab6d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:29:37,743 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 23:29:37,744 INFO L278 IsEmpty]: Start isEmpty. Operand has 134 states, 129 states have (on average 2.705426356589147) internal successors, (349), 133 states have internal predecessors, (349), 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:29:37,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 23:29:37,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:37,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:29:37,751 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:37,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash 334387147, now seen corresponding path program 1 times [2025-04-13 23:29:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:37,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338626018] [2025-04-13 23:29:37,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:37,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:29:37,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:29:37,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:37,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:38,173 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:29:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:38,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338626018] [2025-04-13 23:29:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338626018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:38,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:29:38,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928742951] [2025-04-13 23:29:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:38,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:29:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:38,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:29:38,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:29:38,199 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 2.705426356589147) internal successors, (349), 133 states have internal predecessors, (349), 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) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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:29:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:38,250 INFO L93 Difference]: Finished difference Result 166 states and 401 transitions. [2025-04-13 23:29:38,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:29:38,253 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-04-13 23:29:38,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:38,258 INFO L225 Difference]: With dead ends: 166 [2025-04-13 23:29:38,258 INFO L226 Difference]: Without dead ends: 118 [2025-04-13 23:29:38,260 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:29:38,262 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:38,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:29:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-13 23:29:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-04-13 23:29:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 2.4521739130434783) internal successors, (282), 117 states have internal predecessors, (282), 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:29:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 282 transitions. [2025-04-13 23:29:38,287 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 282 transitions. Word has length 5 [2025-04-13 23:29:38,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:38,287 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 282 transitions. [2025-04-13 23:29:38,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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:29:38,287 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 282 transitions. [2025-04-13 23:29:38,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 23:29:38,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:38,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:29:38,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:29:38,288 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:38,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 334387148, now seen corresponding path program 1 times [2025-04-13 23:29:38,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:38,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016652576] [2025-04-13 23:29:38,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:38,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:29:38,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:29:38,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:38,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:38,441 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:29:38,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:38,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016652576] [2025-04-13 23:29:38,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016652576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:38,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:38,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:29:38,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841204186] [2025-04-13 23:29:38,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:38,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:29:38,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:38,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:29:38,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:29:38,443 INFO L87 Difference]: Start difference. First operand 118 states and 282 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:29:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:38,509 INFO L93 Difference]: Finished difference Result 166 states and 399 transitions. [2025-04-13 23:29:38,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:29:38,511 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-04-13 23:29:38,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:38,512 INFO L225 Difference]: With dead ends: 166 [2025-04-13 23:29:38,513 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 23:29:38,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:29:38,513 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:38,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:29:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 23:29:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-04-13 23:29:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.4489795918367347) internal successors, (360), 149 states have internal predecessors, (360), 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:29:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 360 transitions. [2025-04-13 23:29:38,530 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 360 transitions. Word has length 5 [2025-04-13 23:29:38,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:38,530 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 360 transitions. [2025-04-13 23:29:38,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:29:38,530 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 360 transitions. [2025-04-13 23:29:38,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 23:29:38,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:38,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:38,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:29:38,531 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:38,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash -778775745, now seen corresponding path program 1 times [2025-04-13 23:29:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:38,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332664801] [2025-04-13 23:29:38,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:38,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:29:38,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:29:38,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:38,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:38,617 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:29:38,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:38,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332664801] [2025-04-13 23:29:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332664801] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:38,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:38,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:29:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982562124] [2025-04-13 23:29:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:38,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:29:38,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:38,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:29:38,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:29:38,618 INFO L87 Difference]: Start difference. First operand 150 states and 360 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:29:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:38,674 INFO L93 Difference]: Finished difference Result 163 states and 379 transitions. [2025-04-13 23:29:38,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:29:38,675 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-04-13 23:29:38,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:38,676 INFO L225 Difference]: With dead ends: 163 [2025-04-13 23:29:38,676 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 23:29:38,676 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:29:38,677 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:38,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:29:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 23:29:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-04-13 23:29:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 2.4468085106382977) internal successors, (345), 143 states have internal predecessors, (345), 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:29:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 345 transitions. [2025-04-13 23:29:38,686 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 345 transitions. Word has length 7 [2025-04-13 23:29:38,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:38,686 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 345 transitions. [2025-04-13 23:29:38,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:29:38,686 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 345 transitions. [2025-04-13 23:29:38,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 23:29:38,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:38,687 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:38,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:29:38,687 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:38,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1121426384, now seen corresponding path program 1 times [2025-04-13 23:29:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:38,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201514786] [2025-04-13 23:29:38,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:38,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:29:38,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:29:38,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:38,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:38,948 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:29:38,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:38,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201514786] [2025-04-13 23:29:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201514786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:29:38,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702705577] [2025-04-13 23:29:38,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:29:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:29:38,952 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:29:38,953 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:29:39,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:29:39,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:29:39,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:39,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:39,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:29:39,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:29:39,165 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-13 23:29:39,190 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:29:39,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:29:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702705577] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:29:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:29:39,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 8 [2025-04-13 23:29:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829750392] [2025-04-13 23:29:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:39,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:29:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:39,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:29:39,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:29:39,521 INFO L87 Difference]: Start difference. First operand 144 states and 345 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:29:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:39,576 INFO L93 Difference]: Finished difference Result 231 states and 560 transitions. [2025-04-13 23:29:39,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:29:39,577 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-04-13 23:29:39,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:39,578 INFO L225 Difference]: With dead ends: 231 [2025-04-13 23:29:39,578 INFO L226 Difference]: Without dead ends: 201 [2025-04-13 23:29:39,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:29:39,579 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:39,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:29:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-13 23:29:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 174. [2025-04-13 23:29:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 171 states have (on average 2.508771929824561) internal successors, (429), 173 states have internal predecessors, (429), 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:29:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 429 transitions. [2025-04-13 23:29:39,591 INFO L79 Accepts]: Start accepts. Automaton has 174 states and 429 transitions. Word has length 9 [2025-04-13 23:29:39,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:39,591 INFO L485 AbstractCegarLoop]: Abstraction has 174 states and 429 transitions. [2025-04-13 23:29:39,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:29:39,591 INFO L278 IsEmpty]: Start isEmpty. Operand 174 states and 429 transitions. [2025-04-13 23:29:39,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:29:39,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:39,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:39,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:29:39,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:29:39,793 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:39,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1928922459, now seen corresponding path program 1 times [2025-04-13 23:29:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:39,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123964705] [2025-04-13 23:29:39,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:39,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:29:39,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:29:39,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:39,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:39,885 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:29:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:39,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123964705] [2025-04-13 23:29:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123964705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:39,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:29:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886556362] [2025-04-13 23:29:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:39,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:29:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:39,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:29:39,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:29:39,887 INFO L87 Difference]: Start difference. First operand 174 states and 429 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:29:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:39,935 INFO L93 Difference]: Finished difference Result 253 states and 630 transitions. [2025-04-13 23:29:39,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:29:39,936 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-04-13 23:29:39,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:39,937 INFO L225 Difference]: With dead ends: 253 [2025-04-13 23:29:39,937 INFO L226 Difference]: Without dead ends: 130 [2025-04-13 23:29:39,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:29:39,938 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:39,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:29:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-13 23:29:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2025-04-13 23:29:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 2.327272727272727) internal successors, (256), 113 states have internal predecessors, (256), 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:29:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 256 transitions. [2025-04-13 23:29:39,945 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 256 transitions. Word has length 10 [2025-04-13 23:29:39,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:39,945 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 256 transitions. [2025-04-13 23:29:39,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:29:39,945 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 256 transitions. [2025-04-13 23:29:39,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 23:29:39,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:39,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:39,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:29:39,946 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:39,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -726305118, now seen corresponding path program 1 times [2025-04-13 23:29:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:39,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794266998] [2025-04-13 23:29:39,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:39,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:29:40,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:29:40,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:40,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:29:40,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604663119] [2025-04-13 23:29:40,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:40,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:29:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:29:40,014 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:29:40,019 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:29:40,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:29:40,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:29:40,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:40,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:40,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 23:29:40,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:29:40,302 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 11 treesize of output 7 [2025-04-13 23:29:40,351 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:29:40,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:29:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:40,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794266998] [2025-04-13 23:29:40,352 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:29:40,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604663119] [2025-04-13 23:29:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604663119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:29:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117408096] [2025-04-13 23:29:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:40,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:29:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:40,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:29:40,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:29:40,353 INFO L87 Difference]: Start difference. First operand 114 states and 256 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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:29:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:40,457 INFO L93 Difference]: Finished difference Result 179 states and 400 transitions. [2025-04-13 23:29:40,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:29:40,457 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Word has length 11 [2025-04-13 23:29:40,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:40,458 INFO L225 Difference]: With dead ends: 179 [2025-04-13 23:29:40,458 INFO L226 Difference]: Without dead ends: 172 [2025-04-13 23:29:40,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:29:40,459 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:40,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:29:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-13 23:29:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2025-04-13 23:29:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 160 states have (on average 2.3) internal successors, (368), 163 states have internal predecessors, (368), 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:29:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 368 transitions. [2025-04-13 23:29:40,465 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 368 transitions. Word has length 11 [2025-04-13 23:29:40,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:40,465 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 368 transitions. [2025-04-13 23:29:40,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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:29:40,466 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 368 transitions. [2025-04-13 23:29:40,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:29:40,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:40,467 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:40,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:29:40,668 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:29:40,668 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:40,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1534965065, now seen corresponding path program 1 times [2025-04-13 23:29:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:40,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087698997] [2025-04-13 23:29:40,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:29:40,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:29:40,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:40,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:40,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:40,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087698997] [2025-04-13 23:29:40,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087698997] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:40,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:40,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:29:40,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086402084] [2025-04-13 23:29:40,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:40,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:29:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:40,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:29:40,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:29:40,895 INFO L87 Difference]: Start difference. First operand 164 states and 368 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:29:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:40,943 INFO L93 Difference]: Finished difference Result 184 states and 408 transitions. [2025-04-13 23:29:40,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:29:40,945 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 23:29:40,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:40,946 INFO L225 Difference]: With dead ends: 184 [2025-04-13 23:29:40,947 INFO L226 Difference]: Without dead ends: 151 [2025-04-13 23:29:40,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:29:40,947 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:40,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:29:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-13 23:29:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2025-04-13 23:29:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 2.2517482517482517) internal successors, (322), 146 states have internal predecessors, (322), 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:29:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 322 transitions. [2025-04-13 23:29:40,956 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 322 transitions. Word has length 15 [2025-04-13 23:29:40,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:40,956 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 322 transitions. [2025-04-13 23:29:40,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:29:40,956 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 322 transitions. [2025-04-13 23:29:40,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:29:40,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:40,959 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:40,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:29:40,959 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:40,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash -89455970, now seen corresponding path program 1 times [2025-04-13 23:29:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:40,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312148030] [2025-04-13 23:29:40,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:40,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:29:40,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:29:40,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:40,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:41,159 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:29:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:41,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312148030] [2025-04-13 23:29:41,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312148030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:41,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:29:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614520093] [2025-04-13 23:29:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:41,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:29:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:41,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:29:41,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:29:41,161 INFO L87 Difference]: Start difference. First operand 147 states and 322 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:29:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:41,245 INFO L93 Difference]: Finished difference Result 147 states and 322 transitions. [2025-04-13 23:29:41,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:29:41,246 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 23:29:41,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:41,247 INFO L225 Difference]: With dead ends: 147 [2025-04-13 23:29:41,247 INFO L226 Difference]: Without dead ends: 135 [2025-04-13 23:29:41,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:29:41,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:41,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:29:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-13 23:29:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2025-04-13 23:29:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 121 states have (on average 2.2148760330578514) internal successors, (268), 122 states have internal predecessors, (268), 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:29:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 268 transitions. [2025-04-13 23:29:41,254 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 268 transitions. Word has length 15 [2025-04-13 23:29:41,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:41,254 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 268 transitions. [2025-04-13 23:29:41,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:29:41,254 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 268 transitions. [2025-04-13 23:29:41,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:29:41,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:41,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:41,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:29:41,255 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:41,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1659917168, now seen corresponding path program 1 times [2025-04-13 23:29:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:41,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14203843] [2025-04-13 23:29:41,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:29:41,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:29:41,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:41,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:29:41,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25027970] [2025-04-13 23:29:41,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:29:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:29:41,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:29:41,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:29:41,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:29:41,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:29:41,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:41,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:41,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:29:41,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:29:41,534 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:29:41,545 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:29:41,550 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 11 treesize of output 7 [2025-04-13 23:29:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:41,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:29:42,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-13 23:29:42,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-13 23:29:43,675 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:29:43,675 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 1 case distinctions, treesize of input 17 treesize of output 13 [2025-04-13 23:29:43,827 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:29:43,827 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 1 case distinctions, treesize of input 16 treesize of output 12 [2025-04-13 23:29:44,315 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:29:44,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 488 treesize of output 444 [2025-04-13 23:29:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:48,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14203843] [2025-04-13 23:29:48,098 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:29:48,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25027970] [2025-04-13 23:29:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25027970] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:29:48,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:29:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-04-13 23:29:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149132567] [2025-04-13 23:29:48,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 23:29:48,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:29:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:48,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:29:48,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:29:48,099 INFO L87 Difference]: Start difference. First operand 123 states and 268 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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:29:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:49,208 INFO L93 Difference]: Finished difference Result 290 states and 643 transitions. [2025-04-13 23:29:49,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:29:49,208 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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) Word has length 15 [2025-04-13 23:29:49,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:49,210 INFO L225 Difference]: With dead ends: 290 [2025-04-13 23:29:49,210 INFO L226 Difference]: Without dead ends: 246 [2025-04-13 23:29:49,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:29:49,211 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:49,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:29:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-13 23:29:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 148. [2025-04-13 23:29:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 2.219178082191781) internal successors, (324), 147 states have internal predecessors, (324), 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:29:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 324 transitions. [2025-04-13 23:29:49,218 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 324 transitions. Word has length 15 [2025-04-13 23:29:49,218 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:49,218 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 324 transitions. [2025-04-13 23:29:49,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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:29:49,218 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 324 transitions. [2025-04-13 23:29:49,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:29:49,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:49,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:49,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:29:49,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:29:49,420 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:29:49,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2108824255, now seen corresponding path program 1 times [2025-04-13 23:29:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:49,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543711877] [2025-04-13 23:29:49,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:29:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:29:49,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:49,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:29:49,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [447450711] [2025-04-13 23:29:49,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:29:49,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:29:49,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:29:49,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:29:49,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:29:49,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:29:49,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:29:49,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:49,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:49,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 23:29:49,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:29:49,793 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:29:49,802 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:29:49,806 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:29:49,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-13 23:29:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:50,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:30:08,914 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 9 treesize of output 1 [2025-04-13 23:30:09,045 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:30:09,051 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:30:09,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:30:09,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-04-13 23:30:09,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:30:09,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-04-13 23:30:09,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:30:09,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-04-13 23:30:09,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:30:09,214 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-04-13 23:30:09,228 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:30:09,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-04-13 23:30:09,371 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:30:09,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 10 [2025-04-13 23:30:09,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-04-13 23:30:09,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-04-13 23:30:09,488 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:09,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2025-04-13 23:30:09,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2025-04-13 23:30:09,679 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:30:09,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 40 [2025-04-13 23:30:09,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-04-13 23:30:09,788 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:09,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-04-13 23:30:09,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-04-13 23:30:10,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2025-04-13 23:30:10,086 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:10,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2025-04-13 23:30:10,162 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:30:10,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 10 [2025-04-13 23:30:10,329 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:10,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-04-13 23:30:10,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:30:10,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 10 [2025-04-13 23:30:10,440 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:10,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-04-13 23:30:10,643 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:30:10,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 10 [2025-04-13 23:30:10,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-04-13 23:30:10,721 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-04-13 23:30:10,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:30:10,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 40 [2025-04-13 23:30:10,876 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:10,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-04-13 23:30:11,198 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:11,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2025-04-13 23:30:11,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2025-04-13 23:30:11,233 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:11,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2025-04-13 23:30:11,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-04-13 23:30:11,285 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:11,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-04-13 23:30:11,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2025-04-13 23:30:11,472 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:11,472 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2025-04-13 23:30:11,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2025-04-13 23:30:11,768 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:11,769 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-04-13 23:30:11,863 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2025-04-13 23:30:12,060 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2025-04-13 23:30:12,103 INFO L325 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-04-13 23:30:12,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2025-04-13 23:30:12,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-13 23:30:12,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-04-13 23:30:12,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-13 23:30:12,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-13 23:30:12,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-04-13 23:30:12,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-13 23:30:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:22,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:22,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543711877] [2025-04-13 23:30:22,593 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:30:22,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447450711] [2025-04-13 23:30:22,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447450711] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:30:22,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:30:22,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-04-13 23:30:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054302093] [2025-04-13 23:30:22,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 23:30:22,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:22,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:22,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:22,594 INFO L87 Difference]: Start difference. First operand 148 states and 324 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:29,642 WARN L286 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 400 DAG size of output: 494 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:30:37,401 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-13 23:30:46,634 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-13 23:30:48,503 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-13 23:30:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:53,892 INFO L93 Difference]: Finished difference Result 299 states and 660 transitions. [2025-04-13 23:30:53,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:30:53,892 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 23:30:53,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:53,894 INFO L225 Difference]: With dead ends: 299 [2025-04-13 23:30:53,894 INFO L226 Difference]: Without dead ends: 274 [2025-04-13 23:30:53,894 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:30:53,894 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:53,895 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 370 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2025-04-13 23:30:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-13 23:30:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 188. [2025-04-13 23:30:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.236559139784946) internal successors, (416), 187 states have internal predecessors, (416), 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:30:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 416 transitions. [2025-04-13 23:30:53,899 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 416 transitions. Word has length 19 [2025-04-13 23:30:53,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:53,900 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 416 transitions. [2025-04-13 23:30:53,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:53,900 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 416 transitions. [2025-04-13 23:30:53,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:30:53,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:53,900 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:53,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:30:54,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:30:54,101 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:30:54,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2122868606, now seen corresponding path program 2 times [2025-04-13 23:30:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:54,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402786915] [2025-04-13 23:30:54,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:30:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:54,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:30:54,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:30:54,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:30:54,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:30:54,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835177925] [2025-04-13 23:30:54,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:30:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:30:54,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:30:54,229 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:30:54,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:30:54,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:30:54,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:30:54,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:30:54,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:54,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 23:30:54,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:30:54,510 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:30:54,516 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:30:54,521 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:30:54,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-13 23:30:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:54,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:26,623 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 9 treesize of output 1 [2025-04-13 23:31:26,741 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:31:26,745 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:31:26,763 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:31:26,771 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:31:26,803 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:31:26,809 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:31:26,844 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:31:26,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-13 23:31:26,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-04-13 23:31:26,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-13 23:31:27,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-13 23:31:27,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-04-13 23:31:27,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-13 23:31:27,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 716 treesize of output 688 [2025-04-13 23:31:27,165 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-13 23:31:27,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 758 treesize of output 643 [2025-04-13 23:31:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:31:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:38,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402786915] [2025-04-13 23:31:38,242 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:31:38,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835177925] [2025-04-13 23:31:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835177925] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:38,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:31:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-04-13 23:31:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694785249] [2025-04-13 23:31:38,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:38,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:31:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:38,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:31:38,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:31:38,243 INFO L87 Difference]: Start difference. First operand 188 states and 416 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:58,098 WARN L286 SmtUtils]: Spent 19.45s on a formula simplification. DAG size of input: 394 DAG size of output: 216 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:32:05,472 WARN L286 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 224 DAG size of output: 182 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:32:21,106 WARN L286 SmtUtils]: Spent 14.12s on a formula simplification. DAG size of input: 336 DAG size of output: 207 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:32:29,853 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 336 DAG size of output: 284 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:32:52,075 WARN L286 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 246 DAG size of output: 170 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:32:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:53,108 INFO L93 Difference]: Finished difference Result 663 states and 1485 transitions. [2025-04-13 23:32:53,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:32:53,109 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:32:53,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:53,111 INFO L225 Difference]: With dead ends: 663 [2025-04-13 23:32:53,111 INFO L226 Difference]: Without dead ends: 620 [2025-04-13 23:32:53,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 76.3s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:32:53,112 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 259 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:53,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 0 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 23:32:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-04-13 23:32:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 310. [2025-04-13 23:32:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 308 states have (on average 2.2305194805194803) internal successors, (687), 309 states have internal predecessors, (687), 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:32:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 687 transitions. [2025-04-13 23:32:53,120 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 687 transitions. Word has length 23 [2025-04-13 23:32:53,120 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:53,120 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 687 transitions. [2025-04-13 23:32:53,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:53,120 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 687 transitions. [2025-04-13 23:32:53,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:32:53,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:53,121 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:53,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:32:53,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 23:32:53,321 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:32:53,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:53,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1923217486, now seen corresponding path program 3 times [2025-04-13 23:32:53,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:53,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230743941] [2025-04-13 23:32:53,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:53,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:53,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 23:32:53,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:32:53,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:32:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:32:53,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886054465] [2025-04-13 23:32:53,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:53,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:53,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:53,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:32:53,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:32:53,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 23:32:54,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:32:54,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:32:54,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:54,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 23:32:54,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:32:54,451 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:32:54,457 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:32:54,466 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:32:54,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-04-13 23:32:54,649 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:32:54,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 23:32:54,663 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:32:54,666 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:32:54,847 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:32:54,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-04-13 23:32:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:54,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:33:36,832 WARN L286 SmtUtils]: Spent 12.78s on a formula simplification. DAG size of input: 341 DAG size of output: 335 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:34:03,692 WARN L286 SmtUtils]: Spent 11.28s on a formula simplification that was a NOOP. DAG size: 336 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:35:03,560 WARN L286 SmtUtils]: Spent 21.86s on a formula simplification that was a NOOP. DAG size: 424 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:40:28,742 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 23:40:36,759 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-13 23:44:09,096 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-13 23:44:09,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:44:09,110 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:44:09,113 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:44:09,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:09,297 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-4-2-2-2-2-2-7-3-5-4-4-3-5-6-7-4-6-4-7-2-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. [2025-04-13 23:44:09,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-04-13 23:44:09,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-04-13 23:44:09,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 23:44:09,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 23:44:09,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 23:44:09,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 23:44:09,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 23:44:09,301 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:09,303 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:44:09,303 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:44:09,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:44:09 BasicIcfg [2025-04-13 23:44:09,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:44:09,306 INFO L158 Benchmark]: Toolchain (without parser) took 872805.72ms. Allocated memory was 155.2MB in the beginning and 645.9MB in the end (delta: 490.7MB). Free memory was 106.7MB in the beginning and 245.1MB in the end (delta: -138.4MB). Peak memory consumption was 390.0MB. Max. memory is 8.0GB. [2025-04-13 23:44:09,306 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:44:09,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.71ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 82.9MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 23:44:09,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.62ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:44:09,307 INFO L158 Benchmark]: Boogie Preprocessor took 33.06ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 78.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:44:09,307 INFO L158 Benchmark]: IcfgBuilder took 599.82ms. Allocated memory is still 155.2MB. Free memory was 78.3MB in the beginning and 75.7MB in the end (delta: 2.6MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2025-04-13 23:44:09,307 INFO L158 Benchmark]: TraceAbstraction took 871708.22ms. Allocated memory was 155.2MB in the beginning and 645.9MB in the end (delta: 490.7MB). Free memory was 75.0MB in the beginning and 245.1MB in the end (delta: -170.1MB). Peak memory consumption was 357.8MB. Max. memory is 8.0GB. [2025-04-13 23:44:09,308 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.19ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.71ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 82.9MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.62ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.06ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 78.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 599.82ms. Allocated memory is still 155.2MB. Free memory was 78.3MB in the beginning and 75.7MB in the end (delta: 2.6MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * TraceAbstraction took 871708.22ms. Allocated memory was 155.2MB in the beginning and 645.9MB in the end (delta: 490.7MB). Free memory was 75.0MB in the beginning and 245.1MB in the end (delta: -170.1MB). Peak memory consumption was 357.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-4-2-2-2-2-2-7-3-5-4-4-3-5-6-7-4-6-4-7-2-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-4-2-2-2-2-2-7-3-5-4-4-3-5-6-7-4-6-4-7-2-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-4-2-2-2-2-2-7-3-5-4-4-3-5-6-7-4-6-4-7-2-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-4-2-2-2-2-2-7-3-5-4-4-3-5-6-7-4-6-4-7-2-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-4-2-2-2-2-2-7-3-5-4-4-3-5-6-7-4-6-4-7-2-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 41 locations, 48 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 871.6s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 107.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 646 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 16.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1518 IncrementalHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 0 mSDtfsCounter, 1518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 102.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 561 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 85.1s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 193 ConstructedInterpolants, 3 QuantifiedInterpolants, 38813 SizeOfPredicates, 80 NumberOfNonLiveVariables, 974 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 5/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown