/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-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:51:10,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:51:10,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:51:10,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:51:10,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:51:10,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:51:10,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:51:10,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:51:10,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:51:10,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:51:10,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:51:10,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:51:10,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:51:10,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:51:10,653 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:51:10,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:51:10,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:51:10,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:51:10,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:51:10,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:51:10,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:51:10,655 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 21:51:10,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:51:10,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:51:10,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:51:10,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:51:10,896 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:51:10,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-13 21:51:12,302 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed978c69/26dea3d357934085a078662838f9747e/FLAG7349524fe [2025-04-13 21:51:12,588 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:51:12,589 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-13 21:51:12,616 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed978c69/26dea3d357934085a078662838f9747e/FLAG7349524fe [2025-04-13 21:51:13,504 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed978c69/26dea3d357934085a078662838f9747e [2025-04-13 21:51:13,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:51:13,507 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:51:13,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:51:13,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:51:13,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:51:13,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:51:13" (1/1) ... [2025-04-13 21:51:13,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1055db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:13, skipping insertion in model container [2025-04-13 21:51:13,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:51:13" (1/1) ... [2025-04-13 21:51:13,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:51:13,995 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-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-13 21:51:14,041 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-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-13 21:51:14,047 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-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-13 21:51:14,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:51:14,097 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:51:14,160 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-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-13 21:51:14,171 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-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-13 21:51:14,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-13 21:51:14,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:51:14,266 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:51:14,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14 WrapperNode [2025-04-13 21:51:14,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:51:14,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:51:14,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:51:14,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:51:14,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,383 INFO L138 Inliner]: procedures = 491, calls = 156, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1847 [2025-04-13 21:51:14,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:51:14,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:51:14,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:51:14,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:51:14,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,467 INFO L175 MemorySlicer]: Split 311 memory accesses to 9 slices as follows [2, 8, 6, 2, 80, 2, 195, 12, 4]. 63 percent of accesses are in the largest equivalence class. The 54 initializations are split as follows [2, 2, 0, 0, 20, 0, 26, 4, 0]. The 95 writes are split as follows [0, 2, 4, 1, 20, 1, 61, 4, 2]. [2025-04-13 21:51:14,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:51:14,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:51:14,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:51:14,552 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:51:14,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (1/1) ... [2025-04-13 21:51:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:51:14,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:51:14,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:51:14,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:51:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2025-04-13 21:51:14,597 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 21:51:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:51:14,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-04-13 21:51:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:51:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 21:51:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-13 21:51:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-04-13 21:51:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-04-13 21:51:14,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-04-13 21:51:14,601 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 21:51:14,836 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:51:14,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:51:15,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: havoc ~#r~0#1.base, ~#r~0#1.offset; [2025-04-13 21:51:15,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935-1: SUMMARY for call ULTIMATE.dealloc(~#r~0#1.base, ~#r~0#1.offset); srcloc: null [2025-04-13 21:51:15,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:15,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:15,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:15,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:15,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-04-13 21:51:15,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-14: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-15: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-21: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-22: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-28: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-29: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-35: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-36: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-42: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-43: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-49: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-50: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-56: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-57: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-63: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-64: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-70: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-71: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-10: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-15: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-77: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-78: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-20: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-84: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-85: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-25: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-91: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-30: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-92: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-35: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-98: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-99: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-40: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-105: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-106: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-45: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-50: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-112: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-113: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-55: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-119: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-120: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-60: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-126: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-65: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-127: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-70: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-133: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-134: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-75: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-80: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-85: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-90: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-95: havoc readV_#t~mem39#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc Pop_~temp~2#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-9: havoc Pop_~temp~2#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888: havoc Pop_#t~ret61#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-9: havoc Pop_#t~ret61#1; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946: havoc main_~#handles~0#1.base, main_~#handles~0#1.offset; [2025-04-13 21:51:16,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946-1: SUMMARY for call ULTIMATE.dealloc(main_~#handles~0#1.base, main_~#handles~0#1.offset); srcloc: null [2025-04-13 21:51:16,349 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:51:16,351 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:51:16,351 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:51:17,631 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,682 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,690 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,694 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,698 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,707 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,715 WARN L179 LargeBlockEncoding]: Complex 6:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,742 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,747 WARN L179 LargeBlockEncoding]: Complex 7:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:17,764 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:51:17,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:51:17 BoogieIcfgContainer [2025-04-13 21:51:17,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:51:17,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:51:17,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:51:17,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:51:17,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:51:13" (1/3) ... [2025-04-13 21:51:17,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b3ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:51:17, skipping insertion in model container [2025-04-13 21:51:17,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:14" (2/3) ... [2025-04-13 21:51:17,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b3ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:51:17, skipping insertion in model container [2025-04-13 21:51:17,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:51:17" (3/3) ... [2025-04-13 21:51:17,775 INFO L128 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2025-04-13 21:51:17,789 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:51:17,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG workstealqueue_mutex-2.i that has 2 procedures, 163 locations, 233 edges, 1 initial locations, 11 loop locations, and 5 error locations. [2025-04-13 21:51:17,790 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:51:17,904 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 21:51:17,935 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 166 places, 234 transitions, 475 flow [2025-04-13 21:51:18,043 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2401 states, 2388 states have (on average 2.6009212730318256) internal successors, (6211), 2400 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:18,062 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:51:18,069 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;@1c711aab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:51:18,070 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:51:18,078 INFO L278 IsEmpty]: Start isEmpty. Operand has 2401 states, 2388 states have (on average 2.6009212730318256) internal successors, (6211), 2400 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:18,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:51:18,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:18,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:18,082 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:18,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash 940275696, now seen corresponding path program 1 times [2025-04-13 21:51:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:18,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503085777] [2025-04-13 21:51:18,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:18,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:51:18,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:51:18,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:18,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:18,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503085777] [2025-04-13 21:51:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503085777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:51:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328972218] [2025-04-13 21:51:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:18,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:51:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:18,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:51:18,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:51:18,423 INFO L87 Difference]: Start difference. First operand has 2401 states, 2388 states have (on average 2.6009212730318256) internal successors, (6211), 2400 states have internal predecessors, (6211), 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, 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 21:51:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:18,938 INFO L93 Difference]: Finished difference Result 3038 states and 7687 transitions. [2025-04-13 21:51:18,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:51:18,941 INFO L79 Accepts]: Start accepts. Automaton has has 2 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 21:51:18,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:18,977 INFO L225 Difference]: With dead ends: 3038 [2025-04-13 21:51:18,977 INFO L226 Difference]: Without dead ends: 2218 [2025-04-13 21:51:18,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 21:51:18,987 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:18,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:51:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-04-13 21:51:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2025-04-13 21:51:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2212 states have (on average 2.5289330922242317) internal successors, (5594), 2217 states have internal predecessors, (5594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 5594 transitions. [2025-04-13 21:51:19,125 INFO L79 Accepts]: Start accepts. Automaton has 2218 states and 5594 transitions. Word has length 7 [2025-04-13 21:51:19,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:19,125 INFO L485 AbstractCegarLoop]: Abstraction has 2218 states and 5594 transitions. [2025-04-13 21:51:19,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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 21:51:19,125 INFO L278 IsEmpty]: Start isEmpty. Operand 2218 states and 5594 transitions. [2025-04-13 21:51:19,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:51:19,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:19,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:19,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:51:19,126 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:19,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1662063343, now seen corresponding path program 1 times [2025-04-13 21:51:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:19,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562034084] [2025-04-13 21:51:19,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:19,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:19,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:51:19,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:51:19,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:19,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:19,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562034084] [2025-04-13 21:51:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562034084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:51:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157391310] [2025-04-13 21:51:19,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:19,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:51:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:19,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:51:19,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:51:19,289 INFO L87 Difference]: Start difference. First operand 2218 states and 5594 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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 21:51:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:19,387 INFO L93 Difference]: Finished difference Result 2268 states and 5702 transitions. [2025-04-13 21:51:19,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:51:19,388 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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 21:51:19,388 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:19,392 INFO L225 Difference]: With dead ends: 2268 [2025-04-13 21:51:19,392 INFO L226 Difference]: Without dead ends: 56 [2025-04-13 21:51:19,394 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 21:51:19,395 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:19,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-13 21:51:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-13 21:51:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 55 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 98 transitions. [2025-04-13 21:51:19,399 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 98 transitions. Word has length 9 [2025-04-13 21:51:19,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:19,399 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 98 transitions. [2025-04-13 21:51:19,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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 21:51:19,399 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 98 transitions. [2025-04-13 21:51:19,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 21:51:19,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:19,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:19,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:51:19,400 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:19,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash -17343722, now seen corresponding path program 1 times [2025-04-13 21:51:19,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:19,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065543020] [2025-04-13 21:51:19,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:19,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:51:19,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:51:19,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:19,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:19,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065543020] [2025-04-13 21:51:19,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065543020] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:51:19,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701759040] [2025-04-13 21:51:19,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:19,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:51:19,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:51:19,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:51:19,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:51:19,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:51:19,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:51:19,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:19,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:19,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:51:19,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:51:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:19,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:51:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:19,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701759040] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:51:19,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:51:19,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 21:51:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650955895] [2025-04-13 21:51:19,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:51:19,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:19,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:19,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:19,752 INFO L87 Difference]: Start difference. First operand 56 states and 98 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 21:51:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:19,868 INFO L93 Difference]: Finished difference Result 108 states and 194 transitions. [2025-04-13 21:51:19,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:51:19,869 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 10 [2025-04-13 21:51:19,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:19,871 INFO L225 Difference]: With dead ends: 108 [2025-04-13 21:51:19,871 INFO L226 Difference]: Without dead ends: 59 [2025-04-13 21:51:19,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:19,872 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:19,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:19,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-13 21:51:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-13 21:51:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 101 transitions. [2025-04-13 21:51:19,876 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 101 transitions. Word has length 10 [2025-04-13 21:51:19,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:19,876 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 101 transitions. [2025-04-13 21:51:19,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 21:51:19,876 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 101 transitions. [2025-04-13 21:51:19,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 21:51:19,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:19,876 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:19,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 21:51:20,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:51:20,081 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:20,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1316316335, now seen corresponding path program 2 times [2025-04-13 21:51:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:20,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412454473] [2025-04-13 21:51:20,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:20,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 21:51:20,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:51:20,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:51:20,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:51:20,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:51:20,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:51:20,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:51:20,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:20,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:51:20,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:51:20,252 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:51:20,253 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 21:51:20,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 21:51:20,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 21:51:20,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 21:51:20,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 21:51:20,254 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:51:20,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:51:20,257 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-13 21:51:20,258 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:51:20,258 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 21:51:20,381 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:51:20,385 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184 places, 256 transitions, 528 flow [2025-04-13 21:51:21,394 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 38577 states, 38556 states have (on average 3.829235397862849) internal successors, (147640), 38576 states have internal predecessors, (147640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:21,395 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:51:21,395 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;@1c711aab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:51:21,395 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:51:21,494 INFO L278 IsEmpty]: Start isEmpty. Operand has 38577 states, 38556 states have (on average 3.829235397862849) internal successors, (147640), 38576 states have internal predecessors, (147640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:21,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:51:21,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:21,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:21,495 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:21,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash -508618512, now seen corresponding path program 1 times [2025-04-13 21:51:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:21,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553226812] [2025-04-13 21:51:21,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:21,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:51:21,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:51:21,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:21,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553226812] [2025-04-13 21:51:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553226812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:21,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:21,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:51:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613116474] [2025-04-13 21:51:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:21,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:51:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:21,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:51:21,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:51:21,617 INFO L87 Difference]: Start difference. First operand has 38577 states, 38556 states have (on average 3.829235397862849) internal successors, (147640), 38576 states have internal predecessors, (147640), 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, 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 21:51:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:22,770 INFO L93 Difference]: Finished difference Result 51060 states and 190110 transitions. [2025-04-13 21:51:22,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:51:22,770 INFO L79 Accepts]: Start accepts. Automaton has has 2 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 21:51:22,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:23,056 INFO L225 Difference]: With dead ends: 51060 [2025-04-13 21:51:23,056 INFO L226 Difference]: Without dead ends: 37642 [2025-04-13 21:51:23,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 21:51:23,095 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:23,096 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:51:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2025-04-13 21:51:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 37642. [2025-04-13 21:51:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37642 states, 37630 states have (on average 3.6442466117459476) internal successors, (137133), 37641 states have internal predecessors, (137133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37642 states to 37642 states and 137133 transitions. [2025-04-13 21:51:24,683 INFO L79 Accepts]: Start accepts. Automaton has 37642 states and 137133 transitions. Word has length 7 [2025-04-13 21:51:24,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:24,683 INFO L485 AbstractCegarLoop]: Abstraction has 37642 states and 137133 transitions. [2025-04-13 21:51:24,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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 21:51:24,683 INFO L278 IsEmpty]: Start isEmpty. Operand 37642 states and 137133 transitions. [2025-04-13 21:51:24,684 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:51:24,684 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:24,684 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:24,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:51:24,684 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:24,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash -510135995, now seen corresponding path program 1 times [2025-04-13 21:51:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:24,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805348311] [2025-04-13 21:51:24,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:24,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:51:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:51:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:24,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805348311] [2025-04-13 21:51:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805348311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:24,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:51:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437265001] [2025-04-13 21:51:24,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:24,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:51:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:24,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:51:24,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:51:24,776 INFO L87 Difference]: Start difference. First operand 37642 states and 137133 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 21:51:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:26,462 INFO L93 Difference]: Finished difference Result 107377 states and 396729 transitions. [2025-04-13 21:51:26,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:51:26,463 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 11 [2025-04-13 21:51:26,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:26,875 INFO L225 Difference]: With dead ends: 107377 [2025-04-13 21:51:26,878 INFO L226 Difference]: Without dead ends: 69741 [2025-04-13 21:51:26,958 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 21:51:26,959 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 216 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:26,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 2 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:51:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69741 states. [2025-04-13 21:51:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69741 to 68715. [2025-04-13 21:51:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68715 states, 68709 states have (on average 3.7272555269324252) internal successors, (256096), 68714 states have internal predecessors, (256096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68715 states to 68715 states and 256096 transitions. [2025-04-13 21:51:29,559 INFO L79 Accepts]: Start accepts. Automaton has 68715 states and 256096 transitions. Word has length 11 [2025-04-13 21:51:29,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:29,560 INFO L485 AbstractCegarLoop]: Abstraction has 68715 states and 256096 transitions. [2025-04-13 21:51:29,560 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 21:51:29,560 INFO L278 IsEmpty]: Start isEmpty. Operand 68715 states and 256096 transitions. [2025-04-13 21:51:29,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:51:29,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:29,561 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:29,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:51:29,561 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:29,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -827184468, now seen corresponding path program 1 times [2025-04-13 21:51:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:29,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869577420] [2025-04-13 21:51:29,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:29,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:51:29,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:51:29,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:29,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:29,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869577420] [2025-04-13 21:51:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869577420] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:51:29,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804102312] [2025-04-13 21:51:29,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:29,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:51:29,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:51:29,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:51:29,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:51:29,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:51:29,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:51:29,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:29,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:29,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:51:29,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:51:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:29,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:51:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804102312] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:51:29,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:51:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 21:51:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985663698] [2025-04-13 21:51:29,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:51:29,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:29,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:29,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:29,887 INFO L87 Difference]: Start difference. First operand 68715 states and 256096 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:32,097 INFO L93 Difference]: Finished difference Result 138457 states and 514630 transitions. [2025-04-13 21:51:32,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:51:32,097 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:51:32,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:32,456 INFO L225 Difference]: With dead ends: 138457 [2025-04-13 21:51:32,456 INFO L226 Difference]: Without dead ends: 69749 [2025-04-13 21:51:32,551 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:32,552 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 632 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:32,552 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 3 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 21:51:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69749 states. [2025-04-13 21:51:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69749 to 68718. [2025-04-13 21:51:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68718 states, 68712 states have (on average 3.727136453603446) internal successors, (256099), 68717 states have internal predecessors, (256099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68718 states to 68718 states and 256099 transitions. [2025-04-13 21:51:34,760 INFO L79 Accepts]: Start accepts. Automaton has 68718 states and 256099 transitions. Word has length 12 [2025-04-13 21:51:34,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:34,760 INFO L485 AbstractCegarLoop]: Abstraction has 68718 states and 256099 transitions. [2025-04-13 21:51:34,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:34,761 INFO L278 IsEmpty]: Start isEmpty. Operand 68718 states and 256099 transitions. [2025-04-13 21:51:34,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:51:34,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:34,761 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:34,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 21:51:34,961 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,SelfDestructingSolverStorable6 [2025-04-13 21:51:34,962 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:34,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1930334981, now seen corresponding path program 2 times [2025-04-13 21:51:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:34,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476714983] [2025-04-13 21:51:34,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:34,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:51:34,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-04-13 21:51:34,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:34,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:51:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:35,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476714983] [2025-04-13 21:51:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476714983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:35,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:51:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663862543] [2025-04-13 21:51:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:35,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:51:35,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:35,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:51:35,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:51:35,265 INFO L87 Difference]: Start difference. First operand 68718 states and 256099 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:36,920 INFO L93 Difference]: Finished difference Result 112051 states and 415062 transitions. [2025-04-13 21:51:36,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:51:36,921 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 21:51:36,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:37,574 INFO L225 Difference]: With dead ends: 112051 [2025-04-13 21:51:37,575 INFO L226 Difference]: Without dead ends: 69232 [2025-04-13 21:51:37,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:51:37,639 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 449 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:37,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 0 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:51:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69232 states. [2025-04-13 21:51:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69232 to 68206. [2025-04-13 21:51:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68206 states, 68201 states have (on average 3.7147109279922583) internal successors, (253347), 68205 states have internal predecessors, (253347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68206 states to 68206 states and 253347 transitions. [2025-04-13 21:51:39,915 INFO L79 Accepts]: Start accepts. Automaton has 68206 states and 253347 transitions. Word has length 15 [2025-04-13 21:51:39,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:39,915 INFO L485 AbstractCegarLoop]: Abstraction has 68206 states and 253347 transitions. [2025-04-13 21:51:39,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:39,915 INFO L278 IsEmpty]: Start isEmpty. Operand 68206 states and 253347 transitions. [2025-04-13 21:51:39,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:51:39,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:39,922 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:39,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:51:39,922 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:39,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash 381505519, now seen corresponding path program 1 times [2025-04-13 21:51:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:39,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585401956] [2025-04-13 21:51:39,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:39,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:51:39,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:51:39,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:39,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:51:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:42,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585401956] [2025-04-13 21:51:42,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585401956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:42,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:42,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:51:42,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171621557] [2025-04-13 21:51:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:42,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:42,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:42,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:42,276 INFO L87 Difference]: Start difference. First operand 68206 states and 253347 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:47,133 INFO L93 Difference]: Finished difference Result 148877 states and 550511 transitions. [2025-04-13 21:51:47,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:51:47,133 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 21:51:47,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:47,636 INFO L225 Difference]: With dead ends: 148877 [2025-04-13 21:51:47,637 INFO L226 Difference]: Without dead ends: 83786 [2025-04-13 21:51:47,803 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:51:47,804 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 473 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4794 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:47,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 0 Invalid, 4865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4794 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 21:51:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83786 states. [2025-04-13 21:51:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83786 to 73443. [2025-04-13 21:51:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73443 states, 73438 states have (on average 3.7110351589095565) internal successors, (272531), 73442 states have internal predecessors, (272531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73443 states to 73443 states and 272531 transitions. [2025-04-13 21:51:50,072 INFO L79 Accepts]: Start accepts. Automaton has 73443 states and 272531 transitions. Word has length 29 [2025-04-13 21:51:50,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:50,073 INFO L485 AbstractCegarLoop]: Abstraction has 73443 states and 272531 transitions. [2025-04-13 21:51:50,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:50,073 INFO L278 IsEmpty]: Start isEmpty. Operand 73443 states and 272531 transitions. [2025-04-13 21:51:50,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:51:50,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:50,079 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:50,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:51:50,079 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:51:50,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 324247217, now seen corresponding path program 1 times [2025-04-13 21:51:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:50,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150319554] [2025-04-13 21:51:50,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:50,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:51:50,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:51:50,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:50,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:51:53,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:53,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150319554] [2025-04-13 21:51:53,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150319554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:53,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:53,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:51:53,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204515672] [2025-04-13 21:51:53,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:53,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:51:53,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:53,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:51:53,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:53,659 INFO L87 Difference]: Start difference. First operand 73443 states and 272531 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:58,869 INFO L93 Difference]: Finished difference Result 146597 states and 545217 transitions. [2025-04-13 21:51:58,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:51:58,870 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 21:51:58,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:59,341 INFO L225 Difference]: With dead ends: 146597 [2025-04-13 21:51:59,341 INFO L226 Difference]: Without dead ends: 79718 [2025-04-13 21:51:59,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:51:59,469 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4323 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:59,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 4356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4323 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 21:51:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79718 states. [2025-04-13 21:52:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79718 to 73556. [2025-04-13 21:52:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73556 states, 73551 states have (on average 3.7098068007233076) internal successors, (272860), 73555 states have internal predecessors, (272860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73556 states to 73556 states and 272860 transitions. [2025-04-13 21:52:01,746 INFO L79 Accepts]: Start accepts. Automaton has 73556 states and 272860 transitions. Word has length 29 [2025-04-13 21:52:01,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:01,746 INFO L485 AbstractCegarLoop]: Abstraction has 73556 states and 272860 transitions. [2025-04-13 21:52:01,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:01,747 INFO L278 IsEmpty]: Start isEmpty. Operand 73556 states and 272860 transitions. [2025-04-13 21:52:01,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 21:52:01,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:01,757 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:01,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:52:01,757 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:01,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1562408595, now seen corresponding path program 1 times [2025-04-13 21:52:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:01,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656182001] [2025-04-13 21:52:01,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:01,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 21:52:01,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 21:52:01,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:01,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:01,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:01,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656182001] [2025-04-13 21:52:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656182001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:01,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:01,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:52:01,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275417326] [2025-04-13 21:52:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:01,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:52:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:01,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:52:01,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:01,920 INFO L87 Difference]: Start difference. First operand 73556 states and 272860 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 21:52:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:03,735 INFO L93 Difference]: Finished difference Result 86421 states and 317470 transitions. [2025-04-13 21:52:03,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:52:03,735 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 33 [2025-04-13 21:52:03,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:04,026 INFO L225 Difference]: With dead ends: 86421 [2025-04-13 21:52:04,026 INFO L226 Difference]: Without dead ends: 13610 [2025-04-13 21:52:04,113 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 21:52:04,113 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:04,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:52:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13610 states. [2025-04-13 21:52:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13610 to 13562. [2025-04-13 21:52:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13562 states, 13545 states have (on average 3.1313399778516056) internal successors, (42414), 13561 states have internal predecessors, (42414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13562 states to 13562 states and 42414 transitions. [2025-04-13 21:52:04,550 INFO L79 Accepts]: Start accepts. Automaton has 13562 states and 42414 transitions. Word has length 33 [2025-04-13 21:52:04,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:04,551 INFO L485 AbstractCegarLoop]: Abstraction has 13562 states and 42414 transitions. [2025-04-13 21:52:04,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 21:52:04,551 INFO L278 IsEmpty]: Start isEmpty. Operand 13562 states and 42414 transitions. [2025-04-13 21:52:04,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 21:52:04,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:04,555 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:04,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:52:04,555 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:04,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -496866533, now seen corresponding path program 1 times [2025-04-13 21:52:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:04,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152095592] [2025-04-13 21:52:04,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:04,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 21:52:04,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 21:52:04,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:04,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:09,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:09,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152095592] [2025-04-13 21:52:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152095592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:09,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 21:52:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213832834] [2025-04-13 21:52:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:09,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:52:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:09,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:52:09,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:52:09,635 INFO L87 Difference]: Start difference. First operand 13562 states and 42414 transitions. Second operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:13,045 INFO L93 Difference]: Finished difference Result 26248 states and 81894 transitions. [2025-04-13 21:52:13,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:52:13,045 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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 36 [2025-04-13 21:52:13,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:13,300 INFO L225 Difference]: With dead ends: 26248 [2025-04-13 21:52:13,300 INFO L226 Difference]: Without dead ends: 14102 [2025-04-13 21:52:13,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2025-04-13 21:52:13,327 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3295 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:13,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3295 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 21:52:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14102 states. [2025-04-13 21:52:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14102 to 13642. [2025-04-13 21:52:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13642 states, 13625 states have (on average 3.1299816513761467) internal successors, (42646), 13641 states have internal predecessors, (42646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13642 states to 13642 states and 42646 transitions. [2025-04-13 21:52:13,799 INFO L79 Accepts]: Start accepts. Automaton has 13642 states and 42646 transitions. Word has length 36 [2025-04-13 21:52:13,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:13,799 INFO L485 AbstractCegarLoop]: Abstraction has 13642 states and 42646 transitions. [2025-04-13 21:52:13,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:13,800 INFO L278 IsEmpty]: Start isEmpty. Operand 13642 states and 42646 transitions. [2025-04-13 21:52:13,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:52:13,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:13,804 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:13,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:52:13,805 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:13,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash 991497258, now seen corresponding path program 1 times [2025-04-13 21:52:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:13,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846786231] [2025-04-13 21:52:13,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:13,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:52:13,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:52:13,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:13,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:14,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:14,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846786231] [2025-04-13 21:52:14,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846786231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:14,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:14,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:52:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025638962] [2025-04-13 21:52:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:14,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:52:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:14,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:52:14,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:52:14,568 INFO L87 Difference]: Start difference. First operand 13642 states and 42646 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:16,832 INFO L93 Difference]: Finished difference Result 29992 states and 95908 transitions. [2025-04-13 21:52:16,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:52:16,832 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:52:16,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:17,119 INFO L225 Difference]: With dead ends: 29992 [2025-04-13 21:52:17,119 INFO L226 Difference]: Without dead ends: 18849 [2025-04-13 21:52:17,146 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:52:17,147 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 376 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:17,147 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 0 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 21:52:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18849 states. [2025-04-13 21:52:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18849 to 15248. [2025-04-13 21:52:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15248 states, 15231 states have (on average 3.1197557612763442) internal successors, (47517), 15247 states have internal predecessors, (47517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 47517 transitions. [2025-04-13 21:52:17,730 INFO L79 Accepts]: Start accepts. Automaton has 15248 states and 47517 transitions. Word has length 40 [2025-04-13 21:52:17,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:17,731 INFO L485 AbstractCegarLoop]: Abstraction has 15248 states and 47517 transitions. [2025-04-13 21:52:17,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:17,731 INFO L278 IsEmpty]: Start isEmpty. Operand 15248 states and 47517 transitions. [2025-04-13 21:52:17,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:52:17,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:17,737 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:17,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 21:52:17,737 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:17,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1809145708, now seen corresponding path program 1 times [2025-04-13 21:52:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:17,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292402678] [2025-04-13 21:52:17,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:17,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:17,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:52:17,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:52:17,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:17,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:19,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292402678] [2025-04-13 21:52:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292402678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434176230] [2025-04-13 21:52:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:19,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:19,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:19,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:19,572 INFO L87 Difference]: Start difference. First operand 15248 states and 47517 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:21,635 INFO L93 Difference]: Finished difference Result 28010 states and 86709 transitions. [2025-04-13 21:52:21,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:52:21,635 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:52:21,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:21,916 INFO L225 Difference]: With dead ends: 28010 [2025-04-13 21:52:21,916 INFO L226 Difference]: Without dead ends: 15609 [2025-04-13 21:52:21,940 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:52:21,941 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:21,941 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2147 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 21:52:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15609 states. [2025-04-13 21:52:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15609 to 15328. [2025-04-13 21:52:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15328 states, 15311 states have (on average 3.1142969107177847) internal successors, (47683), 15327 states have internal predecessors, (47683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 47683 transitions. [2025-04-13 21:52:22,444 INFO L79 Accepts]: Start accepts. Automaton has 15328 states and 47683 transitions. Word has length 40 [2025-04-13 21:52:22,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:22,445 INFO L485 AbstractCegarLoop]: Abstraction has 15328 states and 47683 transitions. [2025-04-13 21:52:22,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:22,445 INFO L278 IsEmpty]: Start isEmpty. Operand 15328 states and 47683 transitions. [2025-04-13 21:52:22,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:52:22,450 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:22,450 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:22,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 21:52:22,450 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:22,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash -239975894, now seen corresponding path program 2 times [2025-04-13 21:52:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:22,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668246065] [2025-04-13 21:52:22,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:22,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:52:22,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:52:22,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:23,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668246065] [2025-04-13 21:52:23,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668246065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:23,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:23,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908589172] [2025-04-13 21:52:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:23,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:23,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:23,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:23,433 INFO L87 Difference]: Start difference. First operand 15328 states and 47683 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:25,861 INFO L93 Difference]: Finished difference Result 28386 states and 87958 transitions. [2025-04-13 21:52:25,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:52:25,862 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:52:25,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:26,129 INFO L225 Difference]: With dead ends: 28386 [2025-04-13 21:52:26,130 INFO L226 Difference]: Without dead ends: 16137 [2025-04-13 21:52:26,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:52:26,152 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:26,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 2899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 21:52:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2025-04-13 21:52:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 15576. [2025-04-13 21:52:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15576 states, 15559 states have (on average 3.1109325792146025) internal successors, (48403), 15575 states have internal predecessors, (48403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15576 states to 15576 states and 48403 transitions. [2025-04-13 21:52:26,662 INFO L79 Accepts]: Start accepts. Automaton has 15576 states and 48403 transitions. Word has length 40 [2025-04-13 21:52:26,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:26,662 INFO L485 AbstractCegarLoop]: Abstraction has 15576 states and 48403 transitions. [2025-04-13 21:52:26,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:26,663 INFO L278 IsEmpty]: Start isEmpty. Operand 15576 states and 48403 transitions. [2025-04-13 21:52:26,667 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:52:26,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:26,667 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:26,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 21:52:26,668 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:26,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash -573644194, now seen corresponding path program 3 times [2025-04-13 21:52:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:26,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627982910] [2025-04-13 21:52:26,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:52:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:26,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:52:26,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:52:26,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:52:26,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:28,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627982910] [2025-04-13 21:52:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627982910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:28,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:28,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:52:28,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510252793] [2025-04-13 21:52:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:28,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:52:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:28,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:52:28,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:52:28,016 INFO L87 Difference]: Start difference. First operand 15576 states and 48403 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:31,636 INFO L93 Difference]: Finished difference Result 29074 states and 89990 transitions. [2025-04-13 21:52:31,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:52:31,636 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:52:31,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:31,910 INFO L225 Difference]: With dead ends: 29074 [2025-04-13 21:52:31,910 INFO L226 Difference]: Without dead ends: 16633 [2025-04-13 21:52:31,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:52:31,935 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:31,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 3986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 21:52:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16633 states. [2025-04-13 21:52:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16633 to 15618. [2025-04-13 21:52:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15601 states have (on average 3.1098647522594707) internal successors, (48517), 15617 states have internal predecessors, (48517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 48517 transitions. [2025-04-13 21:52:32,459 INFO L79 Accepts]: Start accepts. Automaton has 15618 states and 48517 transitions. Word has length 40 [2025-04-13 21:52:32,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:32,460 INFO L485 AbstractCegarLoop]: Abstraction has 15618 states and 48517 transitions. [2025-04-13 21:52:32,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:32,460 INFO L278 IsEmpty]: Start isEmpty. Operand 15618 states and 48517 transitions. [2025-04-13 21:52:32,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:52:32,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:32,466 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:32,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 21:52:32,466 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:32,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1160814380, now seen corresponding path program 4 times [2025-04-13 21:52:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:32,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577712960] [2025-04-13 21:52:32,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:52:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:32,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:52:32,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:52:32,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:52:32,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:35,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:35,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577712960] [2025-04-13 21:52:35,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577712960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:35,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:35,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:52:35,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425726452] [2025-04-13 21:52:35,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:35,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:52:35,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:35,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:52:35,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:52:35,300 INFO L87 Difference]: Start difference. First operand 15618 states and 48517 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:44,088 INFO L93 Difference]: Finished difference Result 40802 states and 127899 transitions. [2025-04-13 21:52:44,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 21:52:44,088 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:52:44,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:44,394 INFO L225 Difference]: With dead ends: 40802 [2025-04-13 21:52:44,395 INFO L226 Difference]: Without dead ends: 28985 [2025-04-13 21:52:44,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=844, Invalid=5008, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 21:52:44,422 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 725 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8394 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 8394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:44,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 0 Invalid, 8625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 8394 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-04-13 21:52:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28985 states. [2025-04-13 21:52:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28985 to 16136. [2025-04-13 21:52:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16136 states, 16119 states have (on average 3.1291643402196168) internal successors, (50439), 16135 states have internal predecessors, (50439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 50439 transitions. [2025-04-13 21:52:45,001 INFO L79 Accepts]: Start accepts. Automaton has 16136 states and 50439 transitions. Word has length 40 [2025-04-13 21:52:45,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:45,001 INFO L485 AbstractCegarLoop]: Abstraction has 16136 states and 50439 transitions. [2025-04-13 21:52:45,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:45,001 INFO L278 IsEmpty]: Start isEmpty. Operand 16136 states and 50439 transitions. [2025-04-13 21:52:45,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:52:45,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:45,007 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:45,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 21:52:45,007 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:45,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1103556078, now seen corresponding path program 1 times [2025-04-13 21:52:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:45,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313893329] [2025-04-13 21:52:45,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:52:45,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:52:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:46,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313893329] [2025-04-13 21:52:46,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313893329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:46,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:46,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:52:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583869478] [2025-04-13 21:52:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:46,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:52:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:46,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:52:46,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:52:46,717 INFO L87 Difference]: Start difference. First operand 16136 states and 50439 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:49,788 INFO L93 Difference]: Finished difference Result 29944 states and 93303 transitions. [2025-04-13 21:52:49,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:52:49,788 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:52:49,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:50,062 INFO L225 Difference]: With dead ends: 29944 [2025-04-13 21:52:50,063 INFO L226 Difference]: Without dead ends: 17277 [2025-04-13 21:52:50,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:52:50,088 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3535 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:50,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3535 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 21:52:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2025-04-13 21:52:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 16136. [2025-04-13 21:52:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16136 states, 16119 states have (on average 3.127675414107575) internal successors, (50415), 16135 states have internal predecessors, (50415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 50415 transitions. [2025-04-13 21:52:50,596 INFO L79 Accepts]: Start accepts. Automaton has 16136 states and 50415 transitions. Word has length 40 [2025-04-13 21:52:50,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:50,597 INFO L485 AbstractCegarLoop]: Abstraction has 16136 states and 50415 transitions. [2025-04-13 21:52:50,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:50,597 INFO L278 IsEmpty]: Start isEmpty. Operand 16136 states and 50415 transitions. [2025-04-13 21:52:50,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:52:50,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:50,602 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:50,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 21:52:50,602 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:52:50,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash 926556458, now seen corresponding path program 5 times [2025-04-13 21:52:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:50,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175490170] [2025-04-13 21:52:50,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:52:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:50,631 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:52:50,657 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:52:50,658 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:52:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:52:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:52,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175490170] [2025-04-13 21:52:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175490170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:52,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:52,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:52:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398440948] [2025-04-13 21:52:52,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:52,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:52:52,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:52,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:52:52,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:52:52,694 INFO L87 Difference]: Start difference. First operand 16136 states and 50415 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:02,860 INFO L93 Difference]: Finished difference Result 38585 states and 122057 transitions. [2025-04-13 21:53:02,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 21:53:02,860 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:02,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:03,412 INFO L225 Difference]: With dead ends: 38585 [2025-04-13 21:53:03,412 INFO L226 Difference]: Without dead ends: 26340 [2025-04-13 21:53:03,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=678, Invalid=5328, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 21:53:03,444 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 892 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9479 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 9479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:03,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 0 Invalid, 9809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 9479 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-04-13 21:53:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26340 states. [2025-04-13 21:53:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26340 to 16290. [2025-04-13 21:53:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16290 states, 16273 states have (on average 3.1329810114914274) internal successors, (50983), 16289 states have internal predecessors, (50983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16290 states to 16290 states and 50983 transitions. [2025-04-13 21:53:04,139 INFO L79 Accepts]: Start accepts. Automaton has 16290 states and 50983 transitions. Word has length 40 [2025-04-13 21:53:04,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:04,140 INFO L485 AbstractCegarLoop]: Abstraction has 16290 states and 50983 transitions. [2025-04-13 21:53:04,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:04,140 INFO L278 IsEmpty]: Start isEmpty. Operand 16290 states and 50983 transitions. [2025-04-13 21:53:04,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:04,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:04,145 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:04,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 21:53:04,145 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:04,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 869298156, now seen corresponding path program 2 times [2025-04-13 21:53:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:04,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992768357] [2025-04-13 21:53:04,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:53:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:04,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:53:04,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:53:04,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:53:04,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:53:05,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:05,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992768357] [2025-04-13 21:53:05,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992768357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:05,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:05,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375465898] [2025-04-13 21:53:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:05,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:05,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:05,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:05,562 INFO L87 Difference]: Start difference. First operand 16290 states and 50983 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:08,446 INFO L93 Difference]: Finished difference Result 30238 states and 94219 transitions. [2025-04-13 21:53:08,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:53:08,447 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:08,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:08,733 INFO L225 Difference]: With dead ends: 30238 [2025-04-13 21:53:08,733 INFO L226 Difference]: Without dead ends: 17261 [2025-04-13 21:53:08,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:53:08,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3326 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:08,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 3365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3326 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 21:53:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17261 states. [2025-04-13 21:53:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17261 to 16328. [2025-04-13 21:53:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16328 states, 16311 states have (on average 3.1309545705352217) internal successors, (51069), 16327 states have internal predecessors, (51069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 51069 transitions. [2025-04-13 21:53:09,252 INFO L79 Accepts]: Start accepts. Automaton has 16328 states and 51069 transitions. Word has length 40 [2025-04-13 21:53:09,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:09,252 INFO L485 AbstractCegarLoop]: Abstraction has 16328 states and 51069 transitions. [2025-04-13 21:53:09,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:09,252 INFO L278 IsEmpty]: Start isEmpty. Operand 16328 states and 51069 transitions. [2025-04-13 21:53:09,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:09,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:09,257 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:09,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 21:53:09,257 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:09,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1633952264, now seen corresponding path program 6 times [2025-04-13 21:53:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:09,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501271312] [2025-04-13 21:53:09,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:53:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:09,287 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:53:09,306 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:53:09,306 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:53:09,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:53:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:10,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501271312] [2025-04-13 21:53:10,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501271312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:10,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:53:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782827227] [2025-04-13 21:53:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:10,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:53:10,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:10,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:53:10,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:53:10,918 INFO L87 Difference]: Start difference. First operand 16328 states and 51069 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:15,478 INFO L93 Difference]: Finished difference Result 30422 states and 94682 transitions. [2025-04-13 21:53:15,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 21:53:15,478 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:15,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:15,789 INFO L225 Difference]: With dead ends: 30422 [2025-04-13 21:53:15,789 INFO L226 Difference]: Without dead ends: 17603 [2025-04-13 21:53:15,818 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2025-04-13 21:53:15,819 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4749 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 4749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:15,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 0 Invalid, 4813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 4749 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 21:53:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17603 states. [2025-04-13 21:53:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17603 to 16370. [2025-04-13 21:53:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16370 states, 16353 states have (on average 3.130495933467865) internal successors, (51193), 16369 states have internal predecessors, (51193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16370 states to 16370 states and 51193 transitions. [2025-04-13 21:53:16,369 INFO L79 Accepts]: Start accepts. Automaton has 16370 states and 51193 transitions. Word has length 40 [2025-04-13 21:53:16,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:16,369 INFO L485 AbstractCegarLoop]: Abstraction has 16370 states and 51193 transitions. [2025-04-13 21:53:16,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:16,369 INFO L278 IsEmpty]: Start isEmpty. Operand 16370 states and 51193 transitions. [2025-04-13 21:53:16,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:16,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:16,375 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:16,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 21:53:16,375 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:16,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -283135956, now seen corresponding path program 7 times [2025-04-13 21:53:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:16,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743578129] [2025-04-13 21:53:16,375 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:53:16,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:16,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:53:16,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:53:16,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:53:16,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:53:18,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:18,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743578129] [2025-04-13 21:53:18,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743578129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 21:53:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276784015] [2025-04-13 21:53:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:18,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 21:53:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:18,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 21:53:18,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:53:18,831 INFO L87 Difference]: Start difference. First operand 16370 states and 51193 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:28,218 INFO L93 Difference]: Finished difference Result 38125 states and 119104 transitions. [2025-04-13 21:53:28,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 21:53:28,218 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:28,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:28,601 INFO L225 Difference]: With dead ends: 38125 [2025-04-13 21:53:28,601 INFO L226 Difference]: Without dead ends: 26094 [2025-04-13 21:53:28,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=319, Invalid=2333, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 21:53:28,633 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 772 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10015 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 10015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:28,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 0 Invalid, 10281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 10015 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-04-13 21:53:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26094 states. [2025-04-13 21:53:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26094 to 17058. [2025-04-13 21:53:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17058 states, 17041 states have (on average 3.1452379555190424) internal successors, (53598), 17057 states have internal predecessors, (53598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17058 states to 17058 states and 53598 transitions. [2025-04-13 21:53:29,302 INFO L79 Accepts]: Start accepts. Automaton has 17058 states and 53598 transitions. Word has length 40 [2025-04-13 21:53:29,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:29,303 INFO L485 AbstractCegarLoop]: Abstraction has 17058 states and 53598 transitions. [2025-04-13 21:53:29,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:29,303 INFO L278 IsEmpty]: Start isEmpty. Operand 17058 states and 53598 transitions. [2025-04-13 21:53:29,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:29,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:29,308 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:29,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 21:53:29,309 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:29,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash -340394258, now seen corresponding path program 3 times [2025-04-13 21:53:29,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:29,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830992397] [2025-04-13 21:53:29,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:53:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:29,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:53:29,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:53:29,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:53:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:53:31,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:31,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830992397] [2025-04-13 21:53:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830992397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:31,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:31,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:53:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631638018] [2025-04-13 21:53:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:31,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:53:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:31,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:53:31,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:53:31,797 INFO L87 Difference]: Start difference. First operand 17058 states and 53598 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:36,032 INFO L93 Difference]: Finished difference Result 31212 states and 97558 transitions. [2025-04-13 21:53:36,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:53:36,032 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:36,032 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:36,395 INFO L225 Difference]: With dead ends: 31212 [2025-04-13 21:53:36,395 INFO L226 Difference]: Without dead ends: 17739 [2025-04-13 21:53:36,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:53:36,424 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 234 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4411 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:36,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 0 Invalid, 4450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4411 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 21:53:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17739 states. [2025-04-13 21:53:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17739 to 16382. [2025-04-13 21:53:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16382 states, 16365 states have (on average 3.1286892758936755) internal successors, (51201), 16381 states have internal predecessors, (51201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16382 states to 16382 states and 51201 transitions. [2025-04-13 21:53:37,093 INFO L79 Accepts]: Start accepts. Automaton has 16382 states and 51201 transitions. Word has length 40 [2025-04-13 21:53:37,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:37,093 INFO L485 AbstractCegarLoop]: Abstraction has 16382 states and 51201 transitions. [2025-04-13 21:53:37,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:37,093 INFO L278 IsEmpty]: Start isEmpty. Operand 16382 states and 51201 transitions. [2025-04-13 21:53:37,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:37,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:37,099 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:37,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 21:53:37,100 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:37,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2007953606, now seen corresponding path program 8 times [2025-04-13 21:53:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:37,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429404931] [2025-04-13 21:53:37,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:53:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:37,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:53:37,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:53:37,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:53:37,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:53:38,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:38,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429404931] [2025-04-13 21:53:38,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429404931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:38,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:38,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:53:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347468489] [2025-04-13 21:53:38,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:38,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:53:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:38,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:53:38,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:53:38,956 INFO L87 Difference]: Start difference. First operand 16382 states and 51201 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:43,488 INFO L93 Difference]: Finished difference Result 30394 states and 94507 transitions. [2025-04-13 21:53:43,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 21:53:43,488 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:43,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:43,818 INFO L225 Difference]: With dead ends: 30394 [2025-04-13 21:53:43,818 INFO L226 Difference]: Without dead ends: 17539 [2025-04-13 21:53:43,847 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:53:43,847 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4834 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:43,847 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4834 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 21:53:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17539 states. [2025-04-13 21:53:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17539 to 16292. [2025-04-13 21:53:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16292 states, 16275 states have (on average 3.1249769585253455) internal successors, (50859), 16291 states have internal predecessors, (50859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16292 states to 16292 states and 50859 transitions. [2025-04-13 21:53:44,413 INFO L79 Accepts]: Start accepts. Automaton has 16292 states and 50859 transitions. Word has length 40 [2025-04-13 21:53:44,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:44,414 INFO L485 AbstractCegarLoop]: Abstraction has 16292 states and 50859 transitions. [2025-04-13 21:53:44,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:44,414 INFO L278 IsEmpty]: Start isEmpty. Operand 16292 states and 50859 transitions. [2025-04-13 21:53:44,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:44,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:44,419 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:44,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 21:53:44,419 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:44,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash 13085612, now seen corresponding path program 9 times [2025-04-13 21:53:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:44,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18148224] [2025-04-13 21:53:44,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:53:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:44,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:53:44,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:53:44,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:53:44,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:53:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:46,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18148224] [2025-04-13 21:53:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18148224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:53:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731086159] [2025-04-13 21:53:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:46,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:53:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:46,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:53:46,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:53:46,193 INFO L87 Difference]: Start difference. First operand 16292 states and 50859 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:50,628 INFO L93 Difference]: Finished difference Result 30240 states and 93980 transitions. [2025-04-13 21:53:50,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:53:50,628 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:50,628 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:50,960 INFO L225 Difference]: With dead ends: 30240 [2025-04-13 21:53:50,960 INFO L226 Difference]: Without dead ends: 17503 [2025-04-13 21:53:50,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:53:50,988 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5039 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 5039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:50,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 5082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 5039 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 21:53:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2025-04-13 21:53:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 16268. [2025-04-13 21:53:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16268 states, 16251 states have (on average 3.1256538059196357) internal successors, (50795), 16267 states have internal predecessors, (50795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16268 states to 16268 states and 50795 transitions. [2025-04-13 21:53:51,746 INFO L79 Accepts]: Start accepts. Automaton has 16268 states and 50795 transitions. Word has length 40 [2025-04-13 21:53:51,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:51,746 INFO L485 AbstractCegarLoop]: Abstraction has 16268 states and 50795 transitions. [2025-04-13 21:53:51,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:51,747 INFO L278 IsEmpty]: Start isEmpty. Operand 16268 states and 50795 transitions. [2025-04-13 21:53:51,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:51,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:51,752 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:51,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 21:53:51,752 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:51,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1544822826, now seen corresponding path program 10 times [2025-04-13 21:53:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:51,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513896986] [2025-04-13 21:53:51,753 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:53:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:51,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:53:51,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:53:51,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:53:51,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:53:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:53,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513896986] [2025-04-13 21:53:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513896986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:53:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986099795] [2025-04-13 21:53:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:53,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:53:53,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:53,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:53:53,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:53:53,217 INFO L87 Difference]: Start difference. First operand 16268 states and 50795 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:57,370 INFO L93 Difference]: Finished difference Result 30522 states and 95628 transitions. [2025-04-13 21:53:57,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:53:57,370 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:53:57,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:57,706 INFO L225 Difference]: With dead ends: 30522 [2025-04-13 21:53:57,706 INFO L226 Difference]: Without dead ends: 17605 [2025-04-13 21:53:57,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:53:57,733 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5022 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 5022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:57,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 5074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 5022 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 21:53:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17605 states. [2025-04-13 21:53:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17605 to 16376. [2025-04-13 21:53:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16376 states, 16359 states have (on average 3.1237239440063576) internal successors, (51101), 16375 states have internal predecessors, (51101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16376 states to 16376 states and 51101 transitions. [2025-04-13 21:53:58,296 INFO L79 Accepts]: Start accepts. Automaton has 16376 states and 51101 transitions. Word has length 40 [2025-04-13 21:53:58,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:58,296 INFO L485 AbstractCegarLoop]: Abstraction has 16376 states and 51101 transitions. [2025-04-13 21:53:58,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:58,296 INFO L278 IsEmpty]: Start isEmpty. Operand 16376 states and 51101 transitions. [2025-04-13 21:53:58,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:53:58,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:58,302 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:58,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 21:53:58,302 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:53:58,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1015685896, now seen corresponding path program 11 times [2025-04-13 21:53:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:58,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395920360] [2025-04-13 21:53:58,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:53:58,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:58,332 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:53:58,353 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:53:58,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:53:58,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:00,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395920360] [2025-04-13 21:54:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395920360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:54:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540295470] [2025-04-13 21:54:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:00,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:54:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:00,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:54:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:54:00,049 INFO L87 Difference]: Start difference. First operand 16376 states and 51101 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:03,377 INFO L93 Difference]: Finished difference Result 30668 states and 95944 transitions. [2025-04-13 21:54:03,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:54:03,377 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:54:03,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:03,737 INFO L225 Difference]: With dead ends: 30668 [2025-04-13 21:54:03,737 INFO L226 Difference]: Without dead ends: 17875 [2025-04-13 21:54:03,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:54:03,765 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3619 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:03,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3619 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 21:54:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17875 states. [2025-04-13 21:54:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17875 to 16382. [2025-04-13 21:54:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16382 states, 16365 states have (on average 3.1235563703024747) internal successors, (51117), 16381 states have internal predecessors, (51117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16382 states to 16382 states and 51117 transitions. [2025-04-13 21:54:04,333 INFO L79 Accepts]: Start accepts. Automaton has 16382 states and 51117 transitions. Word has length 40 [2025-04-13 21:54:04,334 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:04,334 INFO L485 AbstractCegarLoop]: Abstraction has 16382 states and 51117 transitions. [2025-04-13 21:54:04,334 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:04,334 INFO L278 IsEmpty]: Start isEmpty. Operand 16382 states and 51117 transitions. [2025-04-13 21:54:04,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:54:04,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:04,339 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:04,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 21:54:04,339 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:54:04,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash 726384170, now seen corresponding path program 12 times [2025-04-13 21:54:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:04,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515998010] [2025-04-13 21:54:04,340 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:54:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:04,368 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:54:04,389 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:54:04,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:54:04,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:06,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:06,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515998010] [2025-04-13 21:54:06,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515998010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:06,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:06,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:54:06,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456302910] [2025-04-13 21:54:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:06,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:54:06,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:06,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:54:06,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:54:06,206 INFO L87 Difference]: Start difference. First operand 16382 states and 51117 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:10,611 INFO L93 Difference]: Finished difference Result 30936 states and 96801 transitions. [2025-04-13 21:54:10,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:54:10,611 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:54:10,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:10,983 INFO L225 Difference]: With dead ends: 30936 [2025-04-13 21:54:10,983 INFO L226 Difference]: Without dead ends: 18139 [2025-04-13 21:54:11,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:54:11,010 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4623 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:11,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 4679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 4623 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 21:54:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18139 states. [2025-04-13 21:54:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18139 to 16412. [2025-04-13 21:54:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16412 states, 16395 states have (on average 3.124916132967368) internal successors, (51233), 16411 states have internal predecessors, (51233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16412 states to 16412 states and 51233 transitions. [2025-04-13 21:54:11,633 INFO L79 Accepts]: Start accepts. Automaton has 16412 states and 51233 transitions. Word has length 40 [2025-04-13 21:54:11,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:11,633 INFO L485 AbstractCegarLoop]: Abstraction has 16412 states and 51233 transitions. [2025-04-13 21:54:11,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:11,633 INFO L278 IsEmpty]: Start isEmpty. Operand 16412 states and 51233 transitions. [2025-04-13 21:54:11,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:54:11,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:11,640 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:11,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 21:54:11,640 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:54:11,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:11,640 INFO L85 PathProgramCache]: Analyzing trace with hash 993167096, now seen corresponding path program 13 times [2025-04-13 21:54:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:11,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253746738] [2025-04-13 21:54:11,640 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:54:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:11,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:54:11,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:54:11,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:54:11,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:13,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253746738] [2025-04-13 21:54:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253746738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:54:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527677327] [2025-04-13 21:54:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:13,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:54:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:13,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:54:13,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:54:13,339 INFO L87 Difference]: Start difference. First operand 16412 states and 51233 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:17,556 INFO L93 Difference]: Finished difference Result 31422 states and 98225 transitions. [2025-04-13 21:54:17,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:54:17,556 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:54:17,556 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:17,959 INFO L225 Difference]: With dead ends: 31422 [2025-04-13 21:54:17,959 INFO L226 Difference]: Without dead ends: 18413 [2025-04-13 21:54:17,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:54:17,994 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4415 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:17,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 4471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 4415 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 21:54:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18413 states. [2025-04-13 21:54:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18413 to 16640. [2025-04-13 21:54:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16640 states, 16623 states have (on average 3.1203152258918365) internal successors, (51869), 16639 states have internal predecessors, (51869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16640 states to 16640 states and 51869 transitions. [2025-04-13 21:54:18,741 INFO L79 Accepts]: Start accepts. Automaton has 16640 states and 51869 transitions. Word has length 40 [2025-04-13 21:54:18,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:18,741 INFO L485 AbstractCegarLoop]: Abstraction has 16640 states and 51869 transitions. [2025-04-13 21:54:18,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:18,741 INFO L278 IsEmpty]: Start isEmpty. Operand 16640 states and 51869 transitions. [2025-04-13 21:54:18,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:54:18,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:18,746 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:18,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 21:54:18,746 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:54:18,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1261751338, now seen corresponding path program 14 times [2025-04-13 21:54:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:18,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887119134] [2025-04-13 21:54:18,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:54:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:18,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:54:18,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:54:18,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:20,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887119134] [2025-04-13 21:54:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887119134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:54:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433718671] [2025-04-13 21:54:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:20,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:54:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:20,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:54:20,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:54:20,263 INFO L87 Difference]: Start difference. First operand 16640 states and 51869 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:23,861 INFO L93 Difference]: Finished difference Result 31432 states and 98230 transitions. [2025-04-13 21:54:23,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:54:23,862 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:54:23,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:24,269 INFO L225 Difference]: With dead ends: 31432 [2025-04-13 21:54:24,269 INFO L226 Difference]: Without dead ends: 18423 [2025-04-13 21:54:24,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:54:24,308 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3830 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:24,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 3878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3830 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 21:54:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18423 states. [2025-04-13 21:54:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18423 to 16682. [2025-04-13 21:54:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16682 states, 16665 states have (on average 3.120972097209721) internal successors, (52011), 16681 states have internal predecessors, (52011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16682 states to 16682 states and 52011 transitions. [2025-04-13 21:54:25,019 INFO L79 Accepts]: Start accepts. Automaton has 16682 states and 52011 transitions. Word has length 40 [2025-04-13 21:54:25,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:25,019 INFO L485 AbstractCegarLoop]: Abstraction has 16682 states and 52011 transitions. [2025-04-13 21:54:25,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:25,019 INFO L278 IsEmpty]: Start isEmpty. Operand 16682 states and 52011 transitions. [2025-04-13 21:54:25,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:54:25,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:25,025 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:25,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 21:54:25,025 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:54:25,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash 668438652, now seen corresponding path program 15 times [2025-04-13 21:54:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:25,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902178596] [2025-04-13 21:54:25,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:54:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:25,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:54:25,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:54:25,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:54:25,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:27,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902178596] [2025-04-13 21:54:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902178596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:27,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:54:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146953835] [2025-04-13 21:54:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:27,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:54:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:27,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:54:27,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:54:27,525 INFO L87 Difference]: Start difference. First operand 16682 states and 52011 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:37,864 INFO L93 Difference]: Finished difference Result 38194 states and 120785 transitions. [2025-04-13 21:54:37,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 21:54:37,864 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:54:37,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:38,384 INFO L225 Difference]: With dead ends: 38194 [2025-04-13 21:54:38,384 INFO L226 Difference]: Without dead ends: 25529 [2025-04-13 21:54:38,419 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=2234, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 21:54:38,420 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 588 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9591 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 9591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:38,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 0 Invalid, 9770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 9591 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-04-13 21:54:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25529 states. [2025-04-13 21:54:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25529 to 16898. [2025-04-13 21:54:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16898 states, 16881 states have (on average 3.126177359161187) internal successors, (52773), 16897 states have internal predecessors, (52773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16898 states to 16898 states and 52773 transitions. [2025-04-13 21:54:39,236 INFO L79 Accepts]: Start accepts. Automaton has 16898 states and 52773 transitions. Word has length 40 [2025-04-13 21:54:39,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:39,236 INFO L485 AbstractCegarLoop]: Abstraction has 16898 states and 52773 transitions. [2025-04-13 21:54:39,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:39,236 INFO L278 IsEmpty]: Start isEmpty. Operand 16898 states and 52773 transitions. [2025-04-13 21:54:39,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:54:39,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:39,243 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:39,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 21:54:39,243 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:54:39,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash 611180350, now seen corresponding path program 4 times [2025-04-13 21:54:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:39,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41486651] [2025-04-13 21:54:39,244 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:54:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:39,275 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:54:39,305 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:54:39,306 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:54:39,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:42,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:42,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41486651] [2025-04-13 21:54:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41486651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:54:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557494817] [2025-04-13 21:54:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:42,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:54:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:42,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:54:42,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:54:42,343 INFO L87 Difference]: Start difference. First operand 16898 states and 52773 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:47,200 INFO L93 Difference]: Finished difference Result 32114 states and 100615 transitions. [2025-04-13 21:54:47,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:54:47,201 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:54:47,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:47,590 INFO L225 Difference]: With dead ends: 32114 [2025-04-13 21:54:47,590 INFO L226 Difference]: Without dead ends: 18875 [2025-04-13 21:54:47,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:54:47,626 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 265 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5186 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:47,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 0 Invalid, 5243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5186 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-04-13 21:54:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18875 states. [2025-04-13 21:54:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18875 to 16844. [2025-04-13 21:54:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16844 states, 16827 states have (on average 3.124799429488322) internal successors, (52581), 16843 states have internal predecessors, (52581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16844 states to 16844 states and 52581 transitions. [2025-04-13 21:54:48,284 INFO L79 Accepts]: Start accepts. Automaton has 16844 states and 52581 transitions. Word has length 40 [2025-04-13 21:54:48,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:48,284 INFO L485 AbstractCegarLoop]: Abstraction has 16844 states and 52581 transitions. [2025-04-13 21:54:48,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:48,284 INFO L278 IsEmpty]: Start isEmpty. Operand 16844 states and 52581 transitions. [2025-04-13 21:54:48,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:54:48,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:48,289 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:48,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 21:54:48,289 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:54:48,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1335439082, now seen corresponding path program 16 times [2025-04-13 21:54:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:48,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401377715] [2025-04-13 21:54:48,290 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:54:48,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:48,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:54:48,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:54:48,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:54:48,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:50,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401377715] [2025-04-13 21:54:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401377715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:54:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975231857] [2025-04-13 21:54:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:50,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:54:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:54:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:54:50,371 INFO L87 Difference]: Start difference. First operand 16844 states and 52581 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:54,595 INFO L93 Difference]: Finished difference Result 31682 states and 99176 transitions. [2025-04-13 21:54:54,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:54:54,595 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:54:54,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:54,987 INFO L225 Difference]: With dead ends: 31682 [2025-04-13 21:54:54,987 INFO L226 Difference]: Without dead ends: 18539 [2025-04-13 21:54:55,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:54:55,019 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 278 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4812 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:55,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 0 Invalid, 4863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4812 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 21:54:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18539 states. [2025-04-13 21:54:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18539 to 16814. [2025-04-13 21:54:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16814 states, 16797 states have (on average 3.125617669821992) internal successors, (52501), 16813 states have internal predecessors, (52501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16814 states to 16814 states and 52501 transitions. [2025-04-13 21:54:55,660 INFO L79 Accepts]: Start accepts. Automaton has 16814 states and 52501 transitions. Word has length 40 [2025-04-13 21:54:55,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:55,660 INFO L485 AbstractCegarLoop]: Abstraction has 16814 states and 52501 transitions. [2025-04-13 21:54:55,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:55,661 INFO L278 IsEmpty]: Start isEmpty. Operand 16814 states and 52501 transitions. [2025-04-13 21:54:55,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:54:55,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:55,666 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:55,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 21:54:55,666 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:54:55,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1713925518, now seen corresponding path program 17 times [2025-04-13 21:54:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:55,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480485050] [2025-04-13 21:54:55,667 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:54:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:55,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:54:55,725 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:54:55,725 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:54:55,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:54:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:57,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480485050] [2025-04-13 21:54:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480485050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:54:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7780702] [2025-04-13 21:54:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:57,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:54:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:57,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:54:57,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:54:57,625 INFO L87 Difference]: Start difference. First operand 16814 states and 52501 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:02,480 INFO L93 Difference]: Finished difference Result 31738 states and 98674 transitions. [2025-04-13 21:55:02,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 21:55:02,480 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:02,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:02,899 INFO L225 Difference]: With dead ends: 31738 [2025-04-13 21:55:02,900 INFO L226 Difference]: Without dead ends: 18423 [2025-04-13 21:55:02,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-04-13 21:55:02,932 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4923 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:02,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 4981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 4923 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-04-13 21:55:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18423 states. [2025-04-13 21:55:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18423 to 16812. [2025-04-13 21:55:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16812 states, 16795 states have (on average 3.125632628758559) internal successors, (52495), 16811 states have internal predecessors, (52495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16812 states to 16812 states and 52495 transitions. [2025-04-13 21:55:03,579 INFO L79 Accepts]: Start accepts. Automaton has 16812 states and 52495 transitions. Word has length 40 [2025-04-13 21:55:03,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:03,579 INFO L485 AbstractCegarLoop]: Abstraction has 16812 states and 52495 transitions. [2025-04-13 21:55:03,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:03,579 INFO L278 IsEmpty]: Start isEmpty. Operand 16812 states and 52495 transitions. [2025-04-13 21:55:03,584 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:03,584 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:03,584 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:03,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 21:55:03,584 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:03,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 577164044, now seen corresponding path program 18 times [2025-04-13 21:55:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:03,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850123732] [2025-04-13 21:55:03,585 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:55:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:03,614 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:55:03,636 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:55:03,636 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:55:03,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:05,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850123732] [2025-04-13 21:55:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850123732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:55:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158375454] [2025-04-13 21:55:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:05,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:55:05,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:05,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:55:05,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:55:05,608 INFO L87 Difference]: Start difference. First operand 16812 states and 52495 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:11,268 INFO L93 Difference]: Finished difference Result 31900 states and 99414 transitions. [2025-04-13 21:55:11,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 21:55:11,268 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:11,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:11,635 INFO L225 Difference]: With dead ends: 31900 [2025-04-13 21:55:11,635 INFO L226 Difference]: Without dead ends: 18781 [2025-04-13 21:55:11,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 21:55:11,665 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5899 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 5899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:11,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 6077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 5899 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-04-13 21:55:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18781 states. [2025-04-13 21:55:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18781 to 16848. [2025-04-13 21:55:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16848 states, 16831 states have (on average 3.1267898520587014) internal successors, (52627), 16847 states have internal predecessors, (52627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 52627 transitions. [2025-04-13 21:55:12,407 INFO L79 Accepts]: Start accepts. Automaton has 16848 states and 52627 transitions. Word has length 40 [2025-04-13 21:55:12,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:12,408 INFO L485 AbstractCegarLoop]: Abstraction has 16848 states and 52627 transitions. [2025-04-13 21:55:12,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:12,408 INFO L278 IsEmpty]: Start isEmpty. Operand 16848 states and 52627 transitions. [2025-04-13 21:55:12,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:12,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:12,414 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:12,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 21:55:12,414 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:12,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1814829162, now seen corresponding path program 2 times [2025-04-13 21:55:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:12,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6683599] [2025-04-13 21:55:12,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:12,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:12,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:55:12,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:55:12,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:12,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:14,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6683599] [2025-04-13 21:55:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6683599] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:14,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289098994] [2025-04-13 21:55:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:14,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:14,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:14,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:14,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:14,038 INFO L87 Difference]: Start difference. First operand 16848 states and 52627 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:18,254 INFO L93 Difference]: Finished difference Result 34858 states and 111268 transitions. [2025-04-13 21:55:18,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:55:18,255 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:18,255 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:18,630 INFO L225 Difference]: With dead ends: 34858 [2025-04-13 21:55:18,630 INFO L226 Difference]: Without dead ends: 21715 [2025-04-13 21:55:18,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:55:18,663 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 388 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5149 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:18,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 0 Invalid, 5179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5149 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 21:55:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21715 states. [2025-04-13 21:55:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21715 to 16692. [2025-04-13 21:55:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16692 states, 16675 states have (on average 3.1303148425787106) internal successors, (52198), 16691 states have internal predecessors, (52198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16692 states to 16692 states and 52198 transitions. [2025-04-13 21:55:19,439 INFO L79 Accepts]: Start accepts. Automaton has 16692 states and 52198 transitions. Word has length 40 [2025-04-13 21:55:19,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:19,440 INFO L485 AbstractCegarLoop]: Abstraction has 16692 states and 52198 transitions. [2025-04-13 21:55:19,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:19,440 INFO L278 IsEmpty]: Start isEmpty. Operand 16692 states and 52198 transitions. [2025-04-13 21:55:19,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:19,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:19,445 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:19,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 21:55:19,445 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:19,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1469020884, now seen corresponding path program 19 times [2025-04-13 21:55:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:19,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817114438] [2025-04-13 21:55:19,445 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:55:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:19,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:55:19,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:55:19,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:19,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:21,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817114438] [2025-04-13 21:55:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817114438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:55:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984207857] [2025-04-13 21:55:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:21,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:55:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:21,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:55:21,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:55:21,304 INFO L87 Difference]: Start difference. First operand 16692 states and 52198 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:25,368 INFO L93 Difference]: Finished difference Result 31374 states and 97531 transitions. [2025-04-13 21:55:25,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:55:25,368 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:25,368 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:25,843 INFO L225 Difference]: With dead ends: 31374 [2025-04-13 21:55:25,843 INFO L226 Difference]: Without dead ends: 18355 [2025-04-13 21:55:25,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:55:25,864 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 336 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3996 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:25,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 0 Invalid, 4033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3996 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 21:55:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18355 states. [2025-04-13 21:55:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18355 to 16692. [2025-04-13 21:55:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16692 states, 16675 states have (on average 3.1299550224887556) internal successors, (52192), 16691 states have internal predecessors, (52192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16692 states to 16692 states and 52192 transitions. [2025-04-13 21:55:26,497 INFO L79 Accepts]: Start accepts. Automaton has 16692 states and 52192 transitions. Word has length 40 [2025-04-13 21:55:26,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:26,498 INFO L485 AbstractCegarLoop]: Abstraction has 16692 states and 52192 transitions. [2025-04-13 21:55:26,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:26,498 INFO L278 IsEmpty]: Start isEmpty. Operand 16692 states and 52192 transitions. [2025-04-13 21:55:26,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:26,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:26,504 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:26,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 21:55:26,504 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:26,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2005233546, now seen corresponding path program 3 times [2025-04-13 21:55:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:26,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50666497] [2025-04-13 21:55:26,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:55:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:26,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:55:26,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:55:26,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:55:26,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:28,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50666497] [2025-04-13 21:55:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50666497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:28,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229164350] [2025-04-13 21:55:28,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:28,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:55:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:28,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:55:28,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:55:28,284 INFO L87 Difference]: Start difference. First operand 16692 states and 52192 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:33,451 INFO L93 Difference]: Finished difference Result 35272 states and 112902 transitions. [2025-04-13 21:55:33,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 21:55:33,452 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:33,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:33,870 INFO L225 Difference]: With dead ends: 35272 [2025-04-13 21:55:33,870 INFO L226 Difference]: Without dead ends: 22901 [2025-04-13 21:55:33,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-04-13 21:55:33,899 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5366 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 5366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:33,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 5447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 5366 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 21:55:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22901 states. [2025-04-13 21:55:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22901 to 17340. [2025-04-13 21:55:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17340 states, 17323 states have (on average 3.149569935923339) internal successors, (54560), 17339 states have internal predecessors, (54560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 54560 transitions. [2025-04-13 21:55:34,603 INFO L79 Accepts]: Start accepts. Automaton has 17340 states and 54560 transitions. Word has length 40 [2025-04-13 21:55:34,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:34,603 INFO L485 AbstractCegarLoop]: Abstraction has 17340 states and 54560 transitions. [2025-04-13 21:55:34,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:34,603 INFO L278 IsEmpty]: Start isEmpty. Operand 17340 states and 54560 transitions. [2025-04-13 21:55:34,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:34,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:34,609 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:34,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 21:55:34,609 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:34,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -797178760, now seen corresponding path program 1 times [2025-04-13 21:55:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:34,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669518886] [2025-04-13 21:55:34,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:34,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:55:34,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:55:34,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:34,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:36,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:36,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669518886] [2025-04-13 21:55:36,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669518886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:36,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:36,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117971028] [2025-04-13 21:55:36,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:36,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:36,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:36,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:36,351 INFO L87 Difference]: Start difference. First operand 17340 states and 54560 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:39,951 INFO L93 Difference]: Finished difference Result 33963 states and 106777 transitions. [2025-04-13 21:55:39,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:55:39,951 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:39,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:40,349 INFO L225 Difference]: With dead ends: 33963 [2025-04-13 21:55:40,350 INFO L226 Difference]: Without dead ends: 20124 [2025-04-13 21:55:40,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:55:40,380 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3979 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:40,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 3997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3979 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 21:55:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20124 states. [2025-04-13 21:55:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20124 to 17364. [2025-04-13 21:55:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17364 states, 17347 states have (on average 3.1493630022482275) internal successors, (54632), 17363 states have internal predecessors, (54632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17364 states to 17364 states and 54632 transitions. [2025-04-13 21:55:41,034 INFO L79 Accepts]: Start accepts. Automaton has 17364 states and 54632 transitions. Word has length 40 [2025-04-13 21:55:41,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:41,034 INFO L485 AbstractCegarLoop]: Abstraction has 17364 states and 54632 transitions. [2025-04-13 21:55:41,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:41,034 INFO L278 IsEmpty]: Start isEmpty. Operand 17364 states and 54632 transitions. [2025-04-13 21:55:41,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:41,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:41,040 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:41,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 21:55:41,040 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:41,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1998670466, now seen corresponding path program 4 times [2025-04-13 21:55:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:41,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99560117] [2025-04-13 21:55:41,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:55:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:41,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:55:41,086 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:55:41,086 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:55:41,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:42,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:42,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99560117] [2025-04-13 21:55:42,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99560117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:42,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:42,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:55:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558930137] [2025-04-13 21:55:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:42,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:55:42,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:42,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:55:42,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:55:42,081 INFO L87 Difference]: Start difference. First operand 17364 states and 54632 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:44,833 INFO L93 Difference]: Finished difference Result 38085 states and 122067 transitions. [2025-04-13 21:55:44,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:55:44,833 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:44,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:45,254 INFO L225 Difference]: With dead ends: 38085 [2025-04-13 21:55:45,254 INFO L226 Difference]: Without dead ends: 24246 [2025-04-13 21:55:45,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:55:45,292 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 406 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:45,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 0 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 21:55:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24246 states. [2025-04-13 21:55:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24246 to 17466. [2025-04-13 21:55:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17466 states, 17449 states have (on average 3.1476302366897815) internal successors, (54923), 17465 states have internal predecessors, (54923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17466 states to 17466 states and 54923 transitions. [2025-04-13 21:55:46,105 INFO L79 Accepts]: Start accepts. Automaton has 17466 states and 54923 transitions. Word has length 40 [2025-04-13 21:55:46,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:46,105 INFO L485 AbstractCegarLoop]: Abstraction has 17466 states and 54923 transitions. [2025-04-13 21:55:46,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:46,105 INFO L278 IsEmpty]: Start isEmpty. Operand 17466 states and 54923 transitions. [2025-04-13 21:55:46,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:46,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:46,110 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:46,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 21:55:46,110 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:46,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash -475306902, now seen corresponding path program 20 times [2025-04-13 21:55:46,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:46,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391671728] [2025-04-13 21:55:46,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:46,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:46,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:55:46,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:55:46,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:46,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:47,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391671728] [2025-04-13 21:55:47,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391671728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:47,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:47,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:47,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926858352] [2025-04-13 21:55:47,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:47,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:47,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:47,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:47,523 INFO L87 Difference]: Start difference. First operand 17466 states and 54923 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:50,138 INFO L93 Difference]: Finished difference Result 33744 states and 106264 transitions. [2025-04-13 21:55:50,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:55:50,138 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:50,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:50,589 INFO L225 Difference]: With dead ends: 33744 [2025-04-13 21:55:50,589 INFO L226 Difference]: Without dead ends: 19765 [2025-04-13 21:55:50,620 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:55:50,621 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:50,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 21:55:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19765 states. [2025-04-13 21:55:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19765 to 17580. [2025-04-13 21:55:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17580 states, 17563 states have (on average 3.1442236519956728) internal successors, (55222), 17579 states have internal predecessors, (55222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17580 states to 17580 states and 55222 transitions. [2025-04-13 21:55:51,337 INFO L79 Accepts]: Start accepts. Automaton has 17580 states and 55222 transitions. Word has length 40 [2025-04-13 21:55:51,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:51,337 INFO L485 AbstractCegarLoop]: Abstraction has 17580 states and 55222 transitions. [2025-04-13 21:55:51,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:51,337 INFO L278 IsEmpty]: Start isEmpty. Operand 17580 states and 55222 transitions. [2025-04-13 21:55:51,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:55:51,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:51,343 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:51,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 21:55:51,343 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:51,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash -6161416, now seen corresponding path program 21 times [2025-04-13 21:55:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:51,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617471366] [2025-04-13 21:55:51,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:55:51,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:51,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:55:51,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:55:51,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:55:51,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:55:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:53,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617471366] [2025-04-13 21:55:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617471366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:53,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:55:53,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379666028] [2025-04-13 21:55:53,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:53,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:55:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:53,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:55:53,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:55:53,635 INFO L87 Difference]: Start difference. First operand 17580 states and 55222 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:59,288 INFO L93 Difference]: Finished difference Result 36241 states and 113637 transitions. [2025-04-13 21:55:59,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 21:55:59,288 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:55:59,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:59,769 INFO L225 Difference]: With dead ends: 36241 [2025-04-13 21:55:59,769 INFO L226 Difference]: Without dead ends: 22926 [2025-04-13 21:55:59,798 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 21:55:59,799 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5767 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 5767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:59,799 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 5866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 5767 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-04-13 21:55:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22926 states. [2025-04-13 21:56:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22926 to 17604. [2025-04-13 21:56:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17604 states, 17587 states have (on average 3.143571956558822) internal successors, (55286), 17603 states have internal predecessors, (55286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17604 states to 17604 states and 55286 transitions. [2025-04-13 21:56:00,641 INFO L79 Accepts]: Start accepts. Automaton has 17604 states and 55286 transitions. Word has length 40 [2025-04-13 21:56:00,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:00,641 INFO L485 AbstractCegarLoop]: Abstraction has 17604 states and 55286 transitions. [2025-04-13 21:56:00,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:00,642 INFO L278 IsEmpty]: Start isEmpty. Operand 17604 states and 55286 transitions. [2025-04-13 21:56:00,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:00,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:00,647 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:00,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 21:56:00,647 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:00,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1259151672, now seen corresponding path program 22 times [2025-04-13 21:56:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:00,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553932652] [2025-04-13 21:56:00,648 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:56:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:00,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:56:00,730 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:56:00,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:56:00,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:04,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:04,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553932652] [2025-04-13 21:56:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553932652] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-04-13 21:56:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077416334] [2025-04-13 21:56:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:04,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:56:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:04,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:56:04,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:56:04,222 INFO L87 Difference]: Start difference. First operand 17604 states and 55286 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:09,397 INFO L93 Difference]: Finished difference Result 33145 states and 103309 transitions. [2025-04-13 21:56:09,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 21:56:09,398 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:56:09,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:09,948 INFO L225 Difference]: With dead ends: 33145 [2025-04-13 21:56:09,948 INFO L226 Difference]: Without dead ends: 20204 [2025-04-13 21:56:09,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=1170, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 21:56:09,974 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5009 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 5009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:09,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 5085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 5009 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 21:56:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20204 states. [2025-04-13 21:56:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20204 to 17622. [2025-04-13 21:56:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17622 states, 17605 states have (on average 3.1435955694405) internal successors, (55343), 17621 states have internal predecessors, (55343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17622 states to 17622 states and 55343 transitions. [2025-04-13 21:56:10,845 INFO L79 Accepts]: Start accepts. Automaton has 17622 states and 55343 transitions. Word has length 40 [2025-04-13 21:56:10,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:10,845 INFO L485 AbstractCegarLoop]: Abstraction has 17622 states and 55343 transitions. [2025-04-13 21:56:10,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:10,845 INFO L278 IsEmpty]: Start isEmpty. Operand 17622 states and 55343 transitions. [2025-04-13 21:56:10,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:10,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:10,851 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:10,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 21:56:10,852 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:10,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -63419718, now seen corresponding path program 5 times [2025-04-13 21:56:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:10,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162944729] [2025-04-13 21:56:10,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:56:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:10,883 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:56:10,909 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:56:10,909 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:56:10,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:13,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162944729] [2025-04-13 21:56:13,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162944729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:56:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406064574] [2025-04-13 21:56:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:13,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:56:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:13,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:56:13,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:56:13,269 INFO L87 Difference]: Start difference. First operand 17622 states and 55343 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:17,281 INFO L93 Difference]: Finished difference Result 32430 states and 101437 transitions. [2025-04-13 21:56:17,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:56:17,281 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:56:17,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:17,778 INFO L225 Difference]: With dead ends: 32430 [2025-04-13 21:56:17,778 INFO L226 Difference]: Without dead ends: 18567 [2025-04-13 21:56:17,807 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:56:17,808 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4331 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:17,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 4357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4331 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 21:56:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2025-04-13 21:56:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 17622. [2025-04-13 21:56:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17622 states, 17605 states have (on average 3.1435955694405) internal successors, (55343), 17621 states have internal predecessors, (55343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17622 states to 17622 states and 55343 transitions. [2025-04-13 21:56:18,554 INFO L79 Accepts]: Start accepts. Automaton has 17622 states and 55343 transitions. Word has length 40 [2025-04-13 21:56:18,554 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:18,554 INFO L485 AbstractCegarLoop]: Abstraction has 17622 states and 55343 transitions. [2025-04-13 21:56:18,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:18,555 INFO L278 IsEmpty]: Start isEmpty. Operand 17622 states and 55343 transitions. [2025-04-13 21:56:18,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:18,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:18,561 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:18,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 21:56:18,561 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:18,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1201893370, now seen corresponding path program 6 times [2025-04-13 21:56:18,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:18,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886170146] [2025-04-13 21:56:18,562 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:56:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:18,593 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:56:18,608 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:56:18,608 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:56:18,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:20,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886170146] [2025-04-13 21:56:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886170146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:20,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:56:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230066397] [2025-04-13 21:56:20,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:20,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:56:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:20,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:56:20,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:56:20,252 INFO L87 Difference]: Start difference. First operand 17622 states and 55343 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:23,446 INFO L93 Difference]: Finished difference Result 32986 states and 103796 transitions. [2025-04-13 21:56:23,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:56:23,447 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:56:23,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:23,927 INFO L225 Difference]: With dead ends: 32986 [2025-04-13 21:56:23,928 INFO L226 Difference]: Without dead ends: 19183 [2025-04-13 21:56:23,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:56:23,959 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3422 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:23,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3422 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 21:56:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19183 states. [2025-04-13 21:56:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19183 to 17658. [2025-04-13 21:56:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17658 states, 17641 states have (on average 3.1436426506433874) internal successors, (55457), 17657 states have internal predecessors, (55457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17658 states to 17658 states and 55457 transitions. [2025-04-13 21:56:24,682 INFO L79 Accepts]: Start accepts. Automaton has 17658 states and 55457 transitions. Word has length 40 [2025-04-13 21:56:24,682 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:24,682 INFO L485 AbstractCegarLoop]: Abstraction has 17658 states and 55457 transitions. [2025-04-13 21:56:24,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:24,682 INFO L278 IsEmpty]: Start isEmpty. Operand 17658 states and 55457 transitions. [2025-04-13 21:56:24,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:24,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:24,687 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:24,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 21:56:24,687 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:24,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1735908650, now seen corresponding path program 23 times [2025-04-13 21:56:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:24,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796689928] [2025-04-13 21:56:24,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:56:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:24,716 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:56:24,736 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:56:24,736 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:56:24,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:26,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796689928] [2025-04-13 21:56:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796689928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:26,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:56:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942014394] [2025-04-13 21:56:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:26,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:56:26,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:26,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:56:26,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:56:26,931 INFO L87 Difference]: Start difference. First operand 17658 states and 55457 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:31,889 INFO L93 Difference]: Finished difference Result 37652 states and 118465 transitions. [2025-04-13 21:56:31,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 21:56:31,889 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:56:31,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:32,368 INFO L225 Difference]: With dead ends: 37652 [2025-04-13 21:56:32,368 INFO L226 Difference]: Without dead ends: 24297 [2025-04-13 21:56:32,402 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 21:56:32,402 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 460 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:32,403 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 0 Invalid, 5478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-04-13 21:56:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24297 states. [2025-04-13 21:56:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24297 to 17682. [2025-04-13 21:56:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17682 states, 17665 states have (on average 3.1429946221341636) internal successors, (55521), 17681 states have internal predecessors, (55521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 55521 transitions. [2025-04-13 21:56:33,206 INFO L79 Accepts]: Start accepts. Automaton has 17682 states and 55521 transitions. Word has length 40 [2025-04-13 21:56:33,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:33,207 INFO L485 AbstractCegarLoop]: Abstraction has 17682 states and 55521 transitions. [2025-04-13 21:56:33,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:33,207 INFO L278 IsEmpty]: Start isEmpty. Operand 17682 states and 55521 transitions. [2025-04-13 21:56:33,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:33,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:33,212 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:33,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 21:56:33,212 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:33,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1293745558, now seen corresponding path program 24 times [2025-04-13 21:56:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:33,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504999355] [2025-04-13 21:56:33,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:56:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:33,240 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:56:33,251 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:56:33,251 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:56:33,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:35,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504999355] [2025-04-13 21:56:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504999355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:56:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884945059] [2025-04-13 21:56:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:35,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:56:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:35,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:56:35,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:56:35,005 INFO L87 Difference]: Start difference. First operand 17682 states and 55521 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:38,148 INFO L93 Difference]: Finished difference Result 33268 states and 104729 transitions. [2025-04-13 21:56:38,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:56:38,148 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:56:38,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:38,605 INFO L225 Difference]: With dead ends: 33268 [2025-04-13 21:56:38,605 INFO L226 Difference]: Without dead ends: 19425 [2025-04-13 21:56:38,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:56:38,630 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:38,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3482 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 21:56:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19425 states. [2025-04-13 21:56:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19425 to 17694. [2025-04-13 21:56:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17694 states, 17677 states have (on average 3.1436895400803304) internal successors, (55571), 17693 states have internal predecessors, (55571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17694 states to 17694 states and 55571 transitions. [2025-04-13 21:56:39,350 INFO L79 Accepts]: Start accepts. Automaton has 17694 states and 55571 transitions. Word has length 40 [2025-04-13 21:56:39,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:39,351 INFO L485 AbstractCegarLoop]: Abstraction has 17694 states and 55571 transitions. [2025-04-13 21:56:39,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:39,351 INFO L278 IsEmpty]: Start isEmpty. Operand 17694 states and 55571 transitions. [2025-04-13 21:56:39,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:39,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:39,356 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:39,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 21:56:39,356 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:39,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1678650348, now seen corresponding path program 7 times [2025-04-13 21:56:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:39,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829583157] [2025-04-13 21:56:39,357 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:56:39,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:39,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:56:39,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:56:39,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:39,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:41,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:41,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829583157] [2025-04-13 21:56:41,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829583157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:41,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:56:41,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203957740] [2025-04-13 21:56:41,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:41,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:56:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:41,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:56:41,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:56:41,153 INFO L87 Difference]: Start difference. First operand 17694 states and 55571 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:44,336 INFO L93 Difference]: Finished difference Result 32622 states and 102049 transitions. [2025-04-13 21:56:44,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:56:44,337 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:56:44,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:44,813 INFO L225 Difference]: With dead ends: 32622 [2025-04-13 21:56:44,813 INFO L226 Difference]: Without dead ends: 18711 [2025-04-13 21:56:44,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:56:44,835 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:44,835 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 3590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 21:56:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18711 states. [2025-04-13 21:56:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18711 to 17670. [2025-04-13 21:56:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17670 states, 17653 states have (on average 3.1443380728488077) internal successors, (55507), 17669 states have internal predecessors, (55507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17670 states to 17670 states and 55507 transitions. [2025-04-13 21:56:45,588 INFO L79 Accepts]: Start accepts. Automaton has 17670 states and 55507 transitions. Word has length 40 [2025-04-13 21:56:45,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:45,588 INFO L485 AbstractCegarLoop]: Abstraction has 17670 states and 55507 transitions. [2025-04-13 21:56:45,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:45,588 INFO L278 IsEmpty]: Start isEmpty. Operand 17670 states and 55507 transitions. [2025-04-13 21:56:45,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:45,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:45,594 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:45,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 21:56:45,594 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:45,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1026962632, now seen corresponding path program 25 times [2025-04-13 21:56:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:45,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032142767] [2025-04-13 21:56:45,595 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:56:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:45,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:56:45,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:56:45,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:45,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:47,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032142767] [2025-04-13 21:56:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032142767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:47,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:56:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350194812] [2025-04-13 21:56:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:47,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:56:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:47,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:56:47,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:56:47,374 INFO L87 Difference]: Start difference. First operand 17670 states and 55507 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:51,512 INFO L93 Difference]: Finished difference Result 33734 states and 106262 transitions. [2025-04-13 21:56:51,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:56:51,512 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:56:51,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:52,005 INFO L225 Difference]: With dead ends: 33734 [2025-04-13 21:56:52,005 INFO L226 Difference]: Without dead ends: 19595 [2025-04-13 21:56:52,035 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-04-13 21:56:52,035 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4509 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:52,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 4578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4509 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 21:56:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19595 states. [2025-04-13 21:56:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19595 to 17636. [2025-04-13 21:56:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17636 states, 17619 states have (on average 3.1447301208922185) internal successors, (55407), 17635 states have internal predecessors, (55407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17636 states to 17636 states and 55407 transitions. [2025-04-13 21:56:53,034 INFO L79 Accepts]: Start accepts. Automaton has 17636 states and 55407 transitions. Word has length 40 [2025-04-13 21:56:53,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:53,034 INFO L485 AbstractCegarLoop]: Abstraction has 17636 states and 55407 transitions. [2025-04-13 21:56:53,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:53,034 INFO L278 IsEmpty]: Start isEmpty. Operand 17636 states and 55407 transitions. [2025-04-13 21:56:53,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:56:53,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:53,039 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:53,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 21:56:53,040 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:53,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2002691576, now seen corresponding path program 26 times [2025-04-13 21:56:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:53,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420654862] [2025-04-13 21:56:53,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:56:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:53,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:56:53,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:56:53,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:56:53,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:56:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:54,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420654862] [2025-04-13 21:56:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420654862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:54,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:54,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:56:54,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278876311] [2025-04-13 21:56:54,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:54,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:56:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:54,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:56:54,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:56:54,693 INFO L87 Difference]: Start difference. First operand 17636 states and 55407 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:02,894 INFO L93 Difference]: Finished difference Result 44553 states and 141201 transitions. [2025-04-13 21:57:02,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 21:57:02,895 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:02,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:03,442 INFO L225 Difference]: With dead ends: 44553 [2025-04-13 21:57:03,442 INFO L226 Difference]: Without dead ends: 31242 [2025-04-13 21:57:03,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=2378, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 21:57:03,488 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 962 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8550 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 8550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:03,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 0 Invalid, 8910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 8550 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-04-13 21:57:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2025-04-13 21:57:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 18372. [2025-04-13 21:57:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18372 states, 18355 states have (on average 3.1592481612639607) internal successors, (57988), 18371 states have internal predecessors, (57988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18372 states to 18372 states and 57988 transitions. [2025-04-13 21:57:04,419 INFO L79 Accepts]: Start accepts. Automaton has 18372 states and 57988 transitions. Word has length 40 [2025-04-13 21:57:04,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:04,420 INFO L485 AbstractCegarLoop]: Abstraction has 18372 states and 57988 transitions. [2025-04-13 21:57:04,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:04,420 INFO L278 IsEmpty]: Start isEmpty. Operand 18372 states and 57988 transitions. [2025-04-13 21:57:04,425 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:04,425 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:04,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 21:57:04,426 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:04,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash -758378390, now seen corresponding path program 27 times [2025-04-13 21:57:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:04,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990387257] [2025-04-13 21:57:04,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:57:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:04,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:57:04,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:57:04,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:57:04,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:06,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990387257] [2025-04-13 21:57:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990387257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:06,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:06,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:57:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420596543] [2025-04-13 21:57:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:06,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:57:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:06,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:57:06,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:57:06,151 INFO L87 Difference]: Start difference. First operand 18372 states and 57988 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:10,355 INFO L93 Difference]: Finished difference Result 34654 states and 109552 transitions. [2025-04-13 21:57:10,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:57:10,355 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:10,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:10,897 INFO L225 Difference]: With dead ends: 34654 [2025-04-13 21:57:10,897 INFO L226 Difference]: Without dead ends: 20353 [2025-04-13 21:57:10,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:57:10,931 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4792 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:10,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 4845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4792 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 21:57:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20353 states. [2025-04-13 21:57:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20353 to 18358. [2025-04-13 21:57:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18358 states, 18341 states have (on average 3.1595878087345293) internal successors, (57950), 18357 states have internal predecessors, (57950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18358 states to 18358 states and 57950 transitions. [2025-04-13 21:57:11,731 INFO L79 Accepts]: Start accepts. Automaton has 18358 states and 57950 transitions. Word has length 40 [2025-04-13 21:57:11,732 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:11,732 INFO L485 AbstractCegarLoop]: Abstraction has 18358 states and 57950 transitions. [2025-04-13 21:57:11,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:11,732 INFO L278 IsEmpty]: Start isEmpty. Operand 18358 states and 57950 transitions. [2025-04-13 21:57:11,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:11,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:11,737 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:11,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 21:57:11,738 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:11,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1945433274, now seen corresponding path program 8 times [2025-04-13 21:57:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:11,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114314444] [2025-04-13 21:57:11,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:57:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:11,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:57:11,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:57:11,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:57:11,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:13,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:13,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114314444] [2025-04-13 21:57:13,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114314444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:13,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:57:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180101795] [2025-04-13 21:57:13,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:13,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:57:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:13,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:57:13,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:57:13,455 INFO L87 Difference]: Start difference. First operand 18358 states and 57950 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:16,563 INFO L93 Difference]: Finished difference Result 33860 states and 106472 transitions. [2025-04-13 21:57:16,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:57:16,563 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:16,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:17,088 INFO L225 Difference]: With dead ends: 33860 [2025-04-13 21:57:17,089 INFO L226 Difference]: Without dead ends: 19379 [2025-04-13 21:57:17,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:57:17,118 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3259 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:17,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3259 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 21:57:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19379 states. [2025-04-13 21:57:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19379 to 18352. [2025-04-13 21:57:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18352 states, 18335 states have (on average 3.1597491137169347) internal successors, (57934), 18351 states have internal predecessors, (57934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18352 states to 18352 states and 57934 transitions. [2025-04-13 21:57:18,133 INFO L79 Accepts]: Start accepts. Automaton has 18352 states and 57934 transitions. Word has length 40 [2025-04-13 21:57:18,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:18,134 INFO L485 AbstractCegarLoop]: Abstraction has 18352 states and 57934 transitions. [2025-04-13 21:57:18,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:18,134 INFO L278 IsEmpty]: Start isEmpty. Operand 18352 states and 57934 transitions. [2025-04-13 21:57:18,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:18,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:18,140 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:18,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 21:57:18,140 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:18,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash -977495946, now seen corresponding path program 5 times [2025-04-13 21:57:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:18,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494606891] [2025-04-13 21:57:18,141 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:57:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:18,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:57:18,193 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:57:18,193 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:57:18,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:19,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:19,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494606891] [2025-04-13 21:57:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494606891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:19,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668984876] [2025-04-13 21:57:19,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:19,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:19,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:19,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:19,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:19,541 INFO L87 Difference]: Start difference. First operand 18352 states and 57934 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:23,981 INFO L93 Difference]: Finished difference Result 37816 states and 122084 transitions. [2025-04-13 21:57:23,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:57:23,981 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:23,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:24,518 INFO L225 Difference]: With dead ends: 37816 [2025-04-13 21:57:24,518 INFO L226 Difference]: Without dead ends: 23423 [2025-04-13 21:57:24,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-04-13 21:57:24,551 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 393 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5383 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 5383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:24,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 0 Invalid, 5416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 5383 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 21:57:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23423 states. [2025-04-13 21:57:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23423 to 18180. [2025-04-13 21:57:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18180 states, 18163 states have (on average 3.1632439574960083) internal successors, (57454), 18179 states have internal predecessors, (57454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18180 states to 18180 states and 57454 transitions. [2025-04-13 21:57:25,389 INFO L79 Accepts]: Start accepts. Automaton has 18180 states and 57454 transitions. Word has length 40 [2025-04-13 21:57:25,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:25,389 INFO L485 AbstractCegarLoop]: Abstraction has 18180 states and 57454 transitions. [2025-04-13 21:57:25,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:25,390 INFO L278 IsEmpty]: Start isEmpty. Operand 18180 states and 57454 transitions. [2025-04-13 21:57:25,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:25,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:25,395 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:25,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 21:57:25,395 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:25,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2080949780, now seen corresponding path program 9 times [2025-04-13 21:57:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:25,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291631137] [2025-04-13 21:57:25,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:57:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:25,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:57:25,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:57:25,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:57:25,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:27,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:27,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291631137] [2025-04-13 21:57:27,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291631137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:27,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:27,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:57:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064845742] [2025-04-13 21:57:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:27,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:57:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:27,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:57:27,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:57:27,046 INFO L87 Difference]: Start difference. First operand 18180 states and 57454 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:30,532 INFO L93 Difference]: Finished difference Result 32930 states and 103385 transitions. [2025-04-13 21:57:30,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:57:30,533 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:30,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:31,036 INFO L225 Difference]: With dead ends: 32930 [2025-04-13 21:57:31,036 INFO L226 Difference]: Without dead ends: 18581 [2025-04-13 21:57:31,151 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:57:31,152 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4046 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:31,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 0 Invalid, 4093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4046 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 21:57:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18581 states. [2025-04-13 21:57:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18581 to 17438. [2025-04-13 21:57:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17438 states, 17421 states have (on average 3.148900751966018) internal successors, (54857), 17437 states have internal predecessors, (54857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17438 states to 17438 states and 54857 transitions. [2025-04-13 21:57:31,876 INFO L79 Accepts]: Start accepts. Automaton has 17438 states and 54857 transitions. Word has length 40 [2025-04-13 21:57:31,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:31,876 INFO L485 AbstractCegarLoop]: Abstraction has 17438 states and 54857 transitions. [2025-04-13 21:57:31,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:31,876 INFO L278 IsEmpty]: Start isEmpty. Operand 17438 states and 54857 transitions. [2025-04-13 21:57:31,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:31,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:31,881 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:31,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 21:57:31,881 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:31,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 33621304, now seen corresponding path program 28 times [2025-04-13 21:57:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:31,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784269697] [2025-04-13 21:57:31,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:57:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:31,912 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:57:31,938 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:57:31,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:57:31,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:34,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784269697] [2025-04-13 21:57:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784269697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:34,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:34,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 21:57:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088283801] [2025-04-13 21:57:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:34,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:57:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:34,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:57:34,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:57:34,319 INFO L87 Difference]: Start difference. First operand 17438 states and 54857 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:40,329 INFO L93 Difference]: Finished difference Result 38621 states and 122139 transitions. [2025-04-13 21:57:40,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 21:57:40,329 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:40,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:40,865 INFO L225 Difference]: With dead ends: 38621 [2025-04-13 21:57:40,866 INFO L226 Difference]: Without dead ends: 25466 [2025-04-13 21:57:40,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=1518, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 21:57:40,908 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 603 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6471 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 6471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:40,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 0 Invalid, 6609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 6471 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-04-13 21:57:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25466 states. [2025-04-13 21:57:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25466 to 17489. [2025-04-13 21:57:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17489 states, 17472 states have (on average 3.1504693223443225) internal successors, (55045), 17488 states have internal predecessors, (55045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17489 states to 17489 states and 55045 transitions. [2025-04-13 21:57:41,885 INFO L79 Accepts]: Start accepts. Automaton has 17489 states and 55045 transitions. Word has length 40 [2025-04-13 21:57:41,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:41,886 INFO L485 AbstractCegarLoop]: Abstraction has 17489 states and 55045 transitions. [2025-04-13 21:57:41,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:41,886 INFO L278 IsEmpty]: Start isEmpty. Operand 17489 states and 55045 transitions. [2025-04-13 21:57:41,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:41,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:41,891 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:41,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 21:57:41,891 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:41,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2052158262, now seen corresponding path program 6 times [2025-04-13 21:57:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:41,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943951468] [2025-04-13 21:57:41,892 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:57:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:41,925 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:57:41,941 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:57:41,941 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:57:41,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:43,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943951468] [2025-04-13 21:57:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943951468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:43,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478102430] [2025-04-13 21:57:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:43,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:43,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:43,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:43,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:43,101 INFO L87 Difference]: Start difference. First operand 17489 states and 55045 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:47,581 INFO L93 Difference]: Finished difference Result 38339 states and 122741 transitions. [2025-04-13 21:57:47,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 21:57:47,581 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:47,582 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:48,121 INFO L225 Difference]: With dead ends: 38339 [2025-04-13 21:57:48,121 INFO L226 Difference]: Without dead ends: 24679 [2025-04-13 21:57:48,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 21:57:48,146 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 435 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4696 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:48,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 0 Invalid, 4738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4696 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 21:57:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24679 states. [2025-04-13 21:57:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24679 to 17593. [2025-04-13 21:57:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17593 states, 17576 states have (on average 3.152708238507055) internal successors, (55412), 17592 states have internal predecessors, (55412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17593 states to 17593 states and 55412 transitions. [2025-04-13 21:57:48,969 INFO L79 Accepts]: Start accepts. Automaton has 17593 states and 55412 transitions. Word has length 40 [2025-04-13 21:57:48,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:48,969 INFO L485 AbstractCegarLoop]: Abstraction has 17593 states and 55412 transitions. [2025-04-13 21:57:48,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:48,969 INFO L278 IsEmpty]: Start isEmpty. Operand 17593 states and 55412 transitions. [2025-04-13 21:57:48,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:48,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:48,974 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:48,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 21:57:48,974 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:48,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash -23636998, now seen corresponding path program 10 times [2025-04-13 21:57:48,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:48,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510599224] [2025-04-13 21:57:48,975 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:57:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:49,003 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:57:49,027 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:57:49,027 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:57:49,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:50,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510599224] [2025-04-13 21:57:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510599224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:50,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:50,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:57:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235495778] [2025-04-13 21:57:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:50,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:57:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:50,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:57:50,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:57:50,984 INFO L87 Difference]: Start difference. First operand 17593 states and 55412 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:54,706 INFO L93 Difference]: Finished difference Result 32953 states and 103008 transitions. [2025-04-13 21:57:54,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:57:54,706 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:57:54,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:55,253 INFO L225 Difference]: With dead ends: 32953 [2025-04-13 21:57:55,253 INFO L226 Difference]: Without dead ends: 18847 [2025-04-13 21:57:55,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:57:55,285 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:55,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 4356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 21:57:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2025-04-13 21:57:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 17500. [2025-04-13 21:57:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17500 states, 17483 states have (on average 3.149230681233198) internal successors, (55058), 17499 states have internal predecessors, (55058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17500 states to 17500 states and 55058 transitions. [2025-04-13 21:57:56,147 INFO L79 Accepts]: Start accepts. Automaton has 17500 states and 55058 transitions. Word has length 40 [2025-04-13 21:57:56,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:56,148 INFO L485 AbstractCegarLoop]: Abstraction has 17500 states and 55058 transitions. [2025-04-13 21:57:56,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:56,148 INFO L278 IsEmpty]: Start isEmpty. Operand 17500 states and 55058 transitions. [2025-04-13 21:57:56,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:57:56,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:56,153 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:56,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 21:57:56,153 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:57:56,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1231691784, now seen corresponding path program 29 times [2025-04-13 21:57:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:56,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117344336] [2025-04-13 21:57:56,154 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:57:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:56,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:57:56,204 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:57:56,204 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:57:56,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:57:57,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:57,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117344336] [2025-04-13 21:57:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117344336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:57:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361094569] [2025-04-13 21:57:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:57,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:57:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:57,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:57:57,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:57:57,992 INFO L87 Difference]: Start difference. First operand 17500 states and 55058 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:03,109 INFO L93 Difference]: Finished difference Result 33157 states and 103497 transitions. [2025-04-13 21:58:03,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:58:03,110 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:58:03,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:03,775 INFO L225 Difference]: With dead ends: 33157 [2025-04-13 21:58:03,775 INFO L226 Difference]: Without dead ends: 19482 [2025-04-13 21:58:03,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:58:03,804 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 324 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5380 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 5380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:03,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 0 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 5380 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 21:58:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19482 states. [2025-04-13 21:58:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19482 to 17424. [2025-04-13 21:58:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17424 states, 17407 states have (on average 3.1476417533176306) internal successors, (54791), 17423 states have internal predecessors, (54791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17424 states to 17424 states and 54791 transitions. [2025-04-13 21:58:04,690 INFO L79 Accepts]: Start accepts. Automaton has 17424 states and 54791 transitions. Word has length 40 [2025-04-13 21:58:04,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:04,691 INFO L485 AbstractCegarLoop]: Abstraction has 17424 states and 54791 transitions. [2025-04-13 21:58:04,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:04,691 INFO L278 IsEmpty]: Start isEmpty. Operand 17424 states and 54791 transitions. [2025-04-13 21:58:04,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:58:04,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:04,696 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:04,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 21:58:04,696 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:58:04,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash -175413288, now seen corresponding path program 11 times [2025-04-13 21:58:04,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:04,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583838006] [2025-04-13 21:58:04,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:58:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:04,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:58:04,745 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:58:04,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:58:04,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:58:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:06,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583838006] [2025-04-13 21:58:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583838006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:58:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999261740] [2025-04-13 21:58:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:06,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:58:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:06,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:58:06,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:58:06,495 INFO L87 Difference]: Start difference. First operand 17424 states and 54791 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:10,035 INFO L93 Difference]: Finished difference Result 32170 states and 100738 transitions. [2025-04-13 21:58:10,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:58:10,035 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:58:10,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:10,550 INFO L225 Difference]: With dead ends: 32170 [2025-04-13 21:58:10,550 INFO L226 Difference]: Without dead ends: 18555 [2025-04-13 21:58:10,579 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:58:10,580 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3783 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:10,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3783 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 21:58:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18555 states. [2025-04-13 21:58:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18555 to 17432. [2025-04-13 21:58:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17432 states, 17415 states have (on average 3.1473442434682743) internal successors, (54811), 17431 states have internal predecessors, (54811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17432 states to 17432 states and 54811 transitions. [2025-04-13 21:58:11,369 INFO L79 Accepts]: Start accepts. Automaton has 17432 states and 54811 transitions. Word has length 40 [2025-04-13 21:58:11,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:11,369 INFO L485 AbstractCegarLoop]: Abstraction has 17432 states and 54811 transitions. [2025-04-13 21:58:11,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:11,369 INFO L278 IsEmpty]: Start isEmpty. Operand 17432 states and 54811 transitions. [2025-04-13 21:58:11,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:58:11,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:11,374 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:11,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 21:58:11,374 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:58:11,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1623915080, now seen corresponding path program 30 times [2025-04-13 21:58:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:11,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033831703] [2025-04-13 21:58:11,375 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:58:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:11,406 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:58:11,424 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:58:11,424 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:58:11,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:58:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:13,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033831703] [2025-04-13 21:58:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033831703] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 21:58:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654536428] [2025-04-13 21:58:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:13,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 21:58:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:13,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 21:58:13,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:58:13,717 INFO L87 Difference]: Start difference. First operand 17432 states and 54811 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:18,187 INFO L93 Difference]: Finished difference Result 34019 states and 106211 transitions. [2025-04-13 21:58:18,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 21:58:18,187 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:58:18,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:18,727 INFO L225 Difference]: With dead ends: 34019 [2025-04-13 21:58:18,727 INFO L226 Difference]: Without dead ends: 20860 [2025-04-13 21:58:18,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 21:58:18,756 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 422 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4707 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 4707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:18,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 0 Invalid, 4837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 4707 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 21:58:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20860 states. [2025-04-13 21:58:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20860 to 17432. [2025-04-13 21:58:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17432 states, 17415 states have (on average 3.1473442434682743) internal successors, (54811), 17431 states have internal predecessors, (54811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17432 states to 17432 states and 54811 transitions. [2025-04-13 21:58:19,604 INFO L79 Accepts]: Start accepts. Automaton has 17432 states and 54811 transitions. Word has length 40 [2025-04-13 21:58:19,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:19,604 INFO L485 AbstractCegarLoop]: Abstraction has 17432 states and 54811 transitions. [2025-04-13 21:58:19,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:19,605 INFO L278 IsEmpty]: Start isEmpty. Operand 17432 states and 54811 transitions. [2025-04-13 21:58:19,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:58:19,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:19,609 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:19,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 21:58:19,610 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:58:19,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1566656778, now seen corresponding path program 12 times [2025-04-13 21:58:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:19,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761018917] [2025-04-13 21:58:19,610 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:58:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:19,768 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:58:19,792 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:58:19,792 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:58:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:58:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:21,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761018917] [2025-04-13 21:58:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761018917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:21,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:21,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:58:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65755001] [2025-04-13 21:58:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:21,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:58:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:21,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:58:21,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:58:21,751 INFO L87 Difference]: Start difference. First operand 17432 states and 54811 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:24,779 INFO L93 Difference]: Finished difference Result 32300 states and 101116 transitions. [2025-04-13 21:58:24,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:58:24,780 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:58:24,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:25,307 INFO L225 Difference]: With dead ends: 32300 [2025-04-13 21:58:25,307 INFO L226 Difference]: Without dead ends: 18609 [2025-04-13 21:58:25,335 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:58:25,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:25,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 3493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 21:58:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18609 states. [2025-04-13 21:58:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18609 to 17414. [2025-04-13 21:58:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 17397 states have (on average 3.147841581881934) internal successors, (54763), 17413 states have internal predecessors, (54763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 54763 transitions. [2025-04-13 21:58:26,134 INFO L79 Accepts]: Start accepts. Automaton has 17414 states and 54763 transitions. Word has length 40 [2025-04-13 21:58:26,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:26,134 INFO L485 AbstractCegarLoop]: Abstraction has 17414 states and 54763 transitions. [2025-04-13 21:58:26,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:26,134 INFO L278 IsEmpty]: Start isEmpty. Operand 17414 states and 54763 transitions. [2025-04-13 21:58:26,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:58:26,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:26,139 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:26,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 21:58:26,139 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:58:26,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1508711260, now seen corresponding path program 13 times [2025-04-13 21:58:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:26,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875963592] [2025-04-13 21:58:26,140 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:58:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:26,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:58:26,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:58:26,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:26,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:58:29,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:29,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875963592] [2025-04-13 21:58:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875963592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:29,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:29,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 21:58:29,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552455585] [2025-04-13 21:58:29,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:29,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 21:58:29,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:29,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 21:58:29,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:58:29,712 INFO L87 Difference]: Start difference. First operand 17414 states and 54763 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:37,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:37,558 INFO L93 Difference]: Finished difference Result 43948 states and 137395 transitions. [2025-04-13 21:58:37,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 21:58:37,558 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:58:37,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:38,149 INFO L225 Difference]: With dead ends: 43948 [2025-04-13 21:58:38,150 INFO L226 Difference]: Without dead ends: 31039 [2025-04-13 21:58:38,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=1804, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 21:58:38,183 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 465 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8503 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 8503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:38,183 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 0 Invalid, 8606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 8503 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-04-13 21:58:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31039 states. [2025-04-13 21:58:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31039 to 18372. [2025-04-13 21:58:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18372 states, 18355 states have (on average 3.160010896213566) internal successors, (58002), 18371 states have internal predecessors, (58002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18372 states to 18372 states and 58002 transitions. [2025-04-13 21:58:39,091 INFO L79 Accepts]: Start accepts. Automaton has 18372 states and 58002 transitions. Word has length 40 [2025-04-13 21:58:39,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:39,091 INFO L485 AbstractCegarLoop]: Abstraction has 18372 states and 58002 transitions. [2025-04-13 21:58:39,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:39,092 INFO L278 IsEmpty]: Start isEmpty. Operand 18372 states and 58002 transitions. [2025-04-13 21:58:39,096 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:58:39,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:39,097 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:39,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 21:58:39,097 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:58:39,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1044185970, now seen corresponding path program 14 times [2025-04-13 21:58:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:39,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629975425] [2025-04-13 21:58:39,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:39,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:58:39,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:58:39,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:58:39,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:58:42,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:42,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629975425] [2025-04-13 21:58:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629975425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:58:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306629792] [2025-04-13 21:58:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:42,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:58:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:42,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:58:42,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:58:42,071 INFO L87 Difference]: Start difference. First operand 18372 states and 58002 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:45,834 INFO L93 Difference]: Finished difference Result 34350 states and 107895 transitions. [2025-04-13 21:58:45,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:58:45,834 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:58:45,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:46,367 INFO L225 Difference]: With dead ends: 34350 [2025-04-13 21:58:46,367 INFO L226 Difference]: Without dead ends: 19623 [2025-04-13 21:58:46,397 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:58:46,397 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4412 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:46,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 4456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4412 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 21:58:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19623 states. [2025-04-13 21:58:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19623 to 18204. [2025-04-13 21:58:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18204 states, 18187 states have (on average 3.159344586792764) internal successors, (57459), 18203 states have internal predecessors, (57459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18204 states to 18204 states and 57459 transitions. [2025-04-13 21:58:47,276 INFO L79 Accepts]: Start accepts. Automaton has 18204 states and 57459 transitions. Word has length 40 [2025-04-13 21:58:47,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:47,276 INFO L485 AbstractCegarLoop]: Abstraction has 18204 states and 57459 transitions. [2025-04-13 21:58:47,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:47,276 INFO L278 IsEmpty]: Start isEmpty. Operand 18204 states and 57459 transitions. [2025-04-13 21:58:47,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:58:47,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:47,282 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:47,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 21:58:47,282 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:58:47,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1850677128, now seen corresponding path program 31 times [2025-04-13 21:58:47,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:47,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490995383] [2025-04-13 21:58:47,282 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:58:47,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:47,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:58:47,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:58:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:58:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:49,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490995383] [2025-04-13 21:58:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490995383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:49,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:49,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:58:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280250985] [2025-04-13 21:58:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:49,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:58:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:49,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:58:49,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:58:49,193 INFO L87 Difference]: Start difference. First operand 18204 states and 57459 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:53,365 INFO L93 Difference]: Finished difference Result 33532 states and 105416 transitions. [2025-04-13 21:58:53,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:58:53,365 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:58:53,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:53,882 INFO L225 Difference]: With dead ends: 33532 [2025-04-13 21:58:53,882 INFO L226 Difference]: Without dead ends: 19279 [2025-04-13 21:58:53,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:58:53,910 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4548 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:53,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 4594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4548 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 21:58:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19279 states. [2025-04-13 21:58:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19279 to 18210. [2025-04-13 21:58:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18210 states, 18193 states have (on average 3.1591821030066507) internal successors, (57475), 18209 states have internal predecessors, (57475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18210 states to 18210 states and 57475 transitions. [2025-04-13 21:58:54,840 INFO L79 Accepts]: Start accepts. Automaton has 18210 states and 57475 transitions. Word has length 40 [2025-04-13 21:58:54,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:54,840 INFO L485 AbstractCegarLoop]: Abstraction has 18210 states and 57475 transitions. [2025-04-13 21:58:54,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:54,841 INFO L278 IsEmpty]: Start isEmpty. Operand 18210 states and 57475 transitions. [2025-04-13 21:58:54,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:58:54,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:54,845 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:54,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 21:58:54,846 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:58:54,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -108607062, now seen corresponding path program 32 times [2025-04-13 21:58:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:54,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676109017] [2025-04-13 21:58:54,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:54,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:58:54,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:58:54,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:58:54,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:58:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:56,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676109017] [2025-04-13 21:58:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676109017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:56,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:56,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 21:58:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609026946] [2025-04-13 21:58:56,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:56,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:58:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:56,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:58:56,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:58:56,644 INFO L87 Difference]: Start difference. First operand 18210 states and 57475 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:01,877 INFO L93 Difference]: Finished difference Result 38364 states and 120654 transitions. [2025-04-13 21:59:01,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 21:59:01,878 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:01,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:02,431 INFO L225 Difference]: With dead ends: 38364 [2025-04-13 21:59:02,431 INFO L226 Difference]: Without dead ends: 24579 [2025-04-13 21:59:02,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 21:59:02,462 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 356 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6034 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 6034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:02,462 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 0 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 6034 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 21:59:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2025-04-13 21:59:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 18300. [2025-04-13 21:59:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18300 states, 18283 states have (on average 3.1626647705518787) internal successors, (57823), 18299 states have internal predecessors, (57823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18300 states to 18300 states and 57823 transitions. [2025-04-13 21:59:03,479 INFO L79 Accepts]: Start accepts. Automaton has 18300 states and 57823 transitions. Word has length 40 [2025-04-13 21:59:03,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:03,479 INFO L485 AbstractCegarLoop]: Abstraction has 18300 states and 57823 transitions. [2025-04-13 21:59:03,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:03,479 INFO L278 IsEmpty]: Start isEmpty. Operand 18300 states and 57823 transitions. [2025-04-13 21:59:03,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:03,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:03,484 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:03,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 21:59:03,484 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:03,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash -165865364, now seen corresponding path program 15 times [2025-04-13 21:59:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:03,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380940936] [2025-04-13 21:59:03,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:03,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:59:03,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:59:03,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:59:03,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:05,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380940936] [2025-04-13 21:59:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380940936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:59:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538939190] [2025-04-13 21:59:05,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:05,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:59:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:05,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:59:05,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:59:05,150 INFO L87 Difference]: Start difference. First operand 18300 states and 57823 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:09,213 INFO L93 Difference]: Finished difference Result 33760 states and 106146 transitions. [2025-04-13 21:59:09,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 21:59:09,213 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:09,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:09,739 INFO L225 Difference]: With dead ends: 33760 [2025-04-13 21:59:09,740 INFO L226 Difference]: Without dead ends: 19385 [2025-04-13 21:59:09,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:59:09,767 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4689 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:09,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 4742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4689 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 21:59:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19385 states. [2025-04-13 21:59:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19385 to 18186. [2025-04-13 21:59:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18186 states, 18169 states have (on average 3.1598326820408387) internal successors, (57411), 18185 states have internal predecessors, (57411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18186 states to 18186 states and 57411 transitions. [2025-04-13 21:59:10,770 INFO L79 Accepts]: Start accepts. Automaton has 18186 states and 57411 transitions. Word has length 40 [2025-04-13 21:59:10,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:10,770 INFO L485 AbstractCegarLoop]: Abstraction has 18186 states and 57411 transitions. [2025-04-13 21:59:10,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:10,771 INFO L278 IsEmpty]: Start isEmpty. Operand 18186 states and 57411 transitions. [2025-04-13 21:59:10,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:10,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:10,775 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:10,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 21:59:10,776 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:10,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -684333832, now seen corresponding path program 33 times [2025-04-13 21:59:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:10,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699703269] [2025-04-13 21:59:10,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:10,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:59:10,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:59:10,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:59:10,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:12,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699703269] [2025-04-13 21:59:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699703269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:12,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:59:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161316601] [2025-04-13 21:59:12,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:12,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:59:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:12,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:59:12,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:59:12,552 INFO L87 Difference]: Start difference. First operand 18186 states and 57411 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:16,394 INFO L93 Difference]: Finished difference Result 33578 states and 105541 transitions. [2025-04-13 21:59:16,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:59:16,394 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:16,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:16,931 INFO L225 Difference]: With dead ends: 33578 [2025-04-13 21:59:16,931 INFO L226 Difference]: Without dead ends: 19337 [2025-04-13 21:59:16,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:59:16,959 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4095 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:16,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 4138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4095 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 21:59:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19337 states. [2025-04-13 21:59:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19337 to 18158. [2025-04-13 21:59:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18158 states, 18141 states have (on average 3.160079378204068) internal successors, (57327), 18157 states have internal predecessors, (57327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18158 states to 18158 states and 57327 transitions. [2025-04-13 21:59:17,936 INFO L79 Accepts]: Start accepts. Automaton has 18158 states and 57327 transitions. Word has length 40 [2025-04-13 21:59:17,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:17,936 INFO L485 AbstractCegarLoop]: Abstraction has 18158 states and 57327 transitions. [2025-04-13 21:59:17,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:17,936 INFO L278 IsEmpty]: Start isEmpty. Operand 18158 states and 57327 transitions. [2025-04-13 21:59:17,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:17,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:17,942 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:17,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 21:59:17,942 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:17,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2042272114, now seen corresponding path program 34 times [2025-04-13 21:59:17,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:17,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749478738] [2025-04-13 21:59:17,942 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:59:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:17,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:59:18,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:59:18,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:59:18,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:19,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749478738] [2025-04-13 21:59:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749478738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:59:19,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960582212] [2025-04-13 21:59:19,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:19,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:59:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:19,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:59:19,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:59:19,948 INFO L87 Difference]: Start difference. First operand 18158 states and 57327 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:24,560 INFO L93 Difference]: Finished difference Result 33434 states and 105095 transitions. [2025-04-13 21:59:24,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:59:24,561 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:24,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:25,090 INFO L225 Difference]: With dead ends: 33434 [2025-04-13 21:59:25,090 INFO L226 Difference]: Without dead ends: 19217 [2025-04-13 21:59:25,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:59:25,115 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4918 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 4918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:25,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 0 Invalid, 4953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 4918 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 21:59:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2025-04-13 21:59:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 18096. [2025-04-13 21:59:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18096 states, 18079 states have (on average 3.159853974224238) internal successors, (57127), 18095 states have internal predecessors, (57127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18096 states to 18096 states and 57127 transitions. [2025-04-13 21:59:25,920 INFO L79 Accepts]: Start accepts. Automaton has 18096 states and 57127 transitions. Word has length 40 [2025-04-13 21:59:25,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:25,920 INFO L485 AbstractCegarLoop]: Abstraction has 18096 states and 57127 transitions. [2025-04-13 21:59:25,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:25,920 INFO L278 IsEmpty]: Start isEmpty. Operand 18096 states and 57127 transitions. [2025-04-13 21:59:25,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:25,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:25,925 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:25,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 21:59:25,925 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:25,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 119976420, now seen corresponding path program 1 times [2025-04-13 21:59:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:25,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917946876] [2025-04-13 21:59:25,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:59:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:25,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:59:25,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:59:25,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:25,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:27,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917946876] [2025-04-13 21:59:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917946876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:27,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:27,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-13 21:59:27,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045328748] [2025-04-13 21:59:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:27,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:59:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:27,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:59:27,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:59:27,943 INFO L87 Difference]: Start difference. First operand 18096 states and 57127 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:32,217 INFO L93 Difference]: Finished difference Result 34937 states and 109315 transitions. [2025-04-13 21:59:32,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 21:59:32,217 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:32,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:32,794 INFO L225 Difference]: With dead ends: 34937 [2025-04-13 21:59:32,795 INFO L226 Difference]: Without dead ends: 21990 [2025-04-13 21:59:32,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 21:59:32,822 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4411 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:32,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 4411 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 21:59:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21990 states. [2025-04-13 21:59:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21990 to 18423. [2025-04-13 21:59:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18423 states, 18406 states have (on average 3.16119743561882) internal successors, (58185), 18422 states have internal predecessors, (58185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18423 states to 18423 states and 58185 transitions. [2025-04-13 21:59:33,670 INFO L79 Accepts]: Start accepts. Automaton has 18423 states and 58185 transitions. Word has length 40 [2025-04-13 21:59:33,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:33,671 INFO L485 AbstractCegarLoop]: Abstraction has 18423 states and 58185 transitions. [2025-04-13 21:59:33,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:33,671 INFO L278 IsEmpty]: Start isEmpty. Operand 18423 states and 58185 transitions. [2025-04-13 21:59:33,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:33,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:33,676 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:33,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 21:59:33,676 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:33,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1451241688, now seen corresponding path program 1 times [2025-04-13 21:59:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:33,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723843492] [2025-04-13 21:59:33,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:59:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:33,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 21:59:33,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:59:33,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:33,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:35,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:35,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723843492] [2025-04-13 21:59:35,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723843492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:35,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:35,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-13 21:59:35,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974780837] [2025-04-13 21:59:35,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:35,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:59:35,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:35,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:59:35,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:59:35,916 INFO L87 Difference]: Start difference. First operand 18423 states and 58185 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:38,977 INFO L93 Difference]: Finished difference Result 32614 states and 102713 transitions. [2025-04-13 21:59:38,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:59:38,977 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:38,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:39,567 INFO L225 Difference]: With dead ends: 32614 [2025-04-13 21:59:39,568 INFO L226 Difference]: Without dead ends: 18783 [2025-04-13 21:59:39,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:59:39,589 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:39,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 3602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3583 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 21:59:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18783 states. [2025-04-13 21:59:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18783 to 18619. [2025-04-13 21:59:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18619 states, 18602 states have (on average 3.1564885496183206) internal successors, (58717), 18618 states have internal predecessors, (58717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18619 states to 18619 states and 58717 transitions. [2025-04-13 21:59:40,514 INFO L79 Accepts]: Start accepts. Automaton has 18619 states and 58717 transitions. Word has length 40 [2025-04-13 21:59:40,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:40,515 INFO L485 AbstractCegarLoop]: Abstraction has 18619 states and 58717 transitions. [2025-04-13 21:59:40,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:40,515 INFO L278 IsEmpty]: Start isEmpty. Operand 18619 states and 58717 transitions. [2025-04-13 21:59:40,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:40,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:40,520 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:40,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 21:59:40,520 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:40,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1210023208, now seen corresponding path program 2 times [2025-04-13 21:59:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:40,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634387912] [2025-04-13 21:59:40,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:40,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:59:40,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:59:40,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:59:40,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:42,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634387912] [2025-04-13 21:59:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634387912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:42,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:59:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141805581] [2025-04-13 21:59:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:42,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:59:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:42,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:59:42,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:59:42,488 INFO L87 Difference]: Start difference. First operand 18619 states and 58717 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:45,913 INFO L93 Difference]: Finished difference Result 33147 states and 104430 transitions. [2025-04-13 21:59:45,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:59:45,913 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:45,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:46,470 INFO L225 Difference]: With dead ends: 33147 [2025-04-13 21:59:46,470 INFO L226 Difference]: Without dead ends: 19498 [2025-04-13 21:59:46,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:59:46,500 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3856 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:46,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3856 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 21:59:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19498 states. [2025-04-13 21:59:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19498 to 18771. [2025-04-13 21:59:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18771 states, 18754 states have (on average 3.1562333368881306) internal successors, (59192), 18770 states have internal predecessors, (59192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18771 states to 18771 states and 59192 transitions. [2025-04-13 21:59:47,354 INFO L79 Accepts]: Start accepts. Automaton has 18771 states and 59192 transitions. Word has length 40 [2025-04-13 21:59:47,354 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:47,354 INFO L485 AbstractCegarLoop]: Abstraction has 18771 states and 59192 transitions. [2025-04-13 21:59:47,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:47,354 INFO L278 IsEmpty]: Start isEmpty. Operand 18771 states and 59192 transitions. [2025-04-13 21:59:47,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:47,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:47,359 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:47,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 21:59:47,359 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:47,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1636086812, now seen corresponding path program 2 times [2025-04-13 21:59:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:47,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931956070] [2025-04-13 21:59:47,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:47,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:59:47,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:59:47,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:59:47,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:48,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:48,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931956070] [2025-04-13 21:59:48,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931956070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:48,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:59:48,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450911895] [2025-04-13 21:59:48,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:48,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:59:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:48,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:59:48,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:59:48,994 INFO L87 Difference]: Start difference. First operand 18771 states and 59192 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:53,050 INFO L93 Difference]: Finished difference Result 35300 states and 111354 transitions. [2025-04-13 21:59:53,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:59:53,051 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 21:59:53,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:53,610 INFO L225 Difference]: With dead ends: 35300 [2025-04-13 21:59:53,610 INFO L226 Difference]: Without dead ends: 20792 [2025-04-13 21:59:53,646 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:59:53,647 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 319 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4499 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:53,647 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 0 Invalid, 4547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4499 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 21:59:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20792 states. [2025-04-13 21:59:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20792 to 19299. [2025-04-13 21:59:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19299 states, 19282 states have (on average 3.144124053521419) internal successors, (60625), 19298 states have internal predecessors, (60625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19299 states to 19299 states and 60625 transitions. [2025-04-13 21:59:54,649 INFO L79 Accepts]: Start accepts. Automaton has 19299 states and 60625 transitions. Word has length 40 [2025-04-13 21:59:54,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:54,649 INFO L485 AbstractCegarLoop]: Abstraction has 19299 states and 60625 transitions. [2025-04-13 21:59:54,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:54,650 INFO L278 IsEmpty]: Start isEmpty. Operand 19299 states and 60625 transitions. [2025-04-13 21:59:54,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 21:59:54,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:54,655 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:54,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 21:59:54,655 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:59:54,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1595396886, now seen corresponding path program 3 times [2025-04-13 21:59:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:54,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784896605] [2025-04-13 21:59:54,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:54,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 21:59:54,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 21:59:54,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:59:54,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 21:59:56,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:56,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784896605] [2025-04-13 21:59:56,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784896605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:59:56,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:59:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:59:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490073006] [2025-04-13 21:59:56,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:59:56,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:59:56,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:56,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:59:56,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:59:56,183 INFO L87 Difference]: Start difference. First operand 19299 states and 60625 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:00,439 INFO L93 Difference]: Finished difference Result 35460 states and 111420 transitions. [2025-04-13 22:00:00,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:00:00,440 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:00,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:01,009 INFO L225 Difference]: With dead ends: 35460 [2025-04-13 22:00:01,010 INFO L226 Difference]: Without dead ends: 20805 [2025-04-13 22:00:01,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:00:01,040 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4616 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 4616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:01,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 4688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 4616 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 22:00:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20805 states. [2025-04-13 22:00:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20805 to 19359. [2025-04-13 22:00:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19359 states, 19342 states have (on average 3.144349084892979) internal successors, (60818), 19358 states have internal predecessors, (60818), 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 22:00:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19359 states to 19359 states and 60818 transitions. [2025-04-13 22:00:01,920 INFO L79 Accepts]: Start accepts. Automaton has 19359 states and 60818 transitions. Word has length 40 [2025-04-13 22:00:01,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:01,920 INFO L485 AbstractCegarLoop]: Abstraction has 19359 states and 60818 transitions. [2025-04-13 22:00:01,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:01,921 INFO L278 IsEmpty]: Start isEmpty. Operand 19359 states and 60818 transitions. [2025-04-13 22:00:01,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:01,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:01,926 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:01,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 22:00:01,926 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:01,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash -206873316, now seen corresponding path program 4 times [2025-04-13 22:00:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:01,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499982278] [2025-04-13 22:00:01,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:02,103 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:00:02,130 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:00:02,131 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:02,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:04,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499982278] [2025-04-13 22:00:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499982278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:00:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:00:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 22:00:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035672606] [2025-04-13 22:00:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:00:04,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:00:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:04,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:00:04,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:00:04,451 INFO L87 Difference]: Start difference. First operand 19359 states and 60818 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:11,560 INFO L93 Difference]: Finished difference Result 39611 states and 123928 transitions. [2025-04-13 22:00:11,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:00:11,561 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:11,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:12,175 INFO L225 Difference]: With dead ends: 39611 [2025-04-13 22:00:12,175 INFO L226 Difference]: Without dead ends: 25807 [2025-04-13 22:00:12,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:00:12,209 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 462 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7276 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 7276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:12,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 0 Invalid, 7409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 7276 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-04-13 22:00:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25807 states. [2025-04-13 22:00:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25807 to 19485. [2025-04-13 22:00:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19485 states, 19468 states have (on average 3.1468050133552494) internal successors, (61262), 19484 states have internal predecessors, (61262), 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 22:00:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 61262 transitions. [2025-04-13 22:00:13,149 INFO L79 Accepts]: Start accepts. Automaton has 19485 states and 61262 transitions. Word has length 40 [2025-04-13 22:00:13,149 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:13,149 INFO L485 AbstractCegarLoop]: Abstraction has 19485 states and 61262 transitions. [2025-04-13 22:00:13,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:13,149 INFO L278 IsEmpty]: Start isEmpty. Operand 19485 states and 61262 transitions. [2025-04-13 22:00:13,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:13,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:13,155 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:13,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 22:00:13,155 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:13,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1565089454, now seen corresponding path program 5 times [2025-04-13 22:00:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:13,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262608686] [2025-04-13 22:00:13,156 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:13,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:00:13,203 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:00:13,203 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:13,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:15,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:15,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262608686] [2025-04-13 22:00:15,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262608686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:00:15,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:00:15,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:00:15,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473064136] [2025-04-13 22:00:15,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:00:15,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:00:15,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:00:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:00:15,025 INFO L87 Difference]: Start difference. First operand 19485 states and 61262 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:18,819 INFO L93 Difference]: Finished difference Result 34723 states and 109089 transitions. [2025-04-13 22:00:18,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:00:18,820 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:18,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:19,402 INFO L225 Difference]: With dead ends: 34723 [2025-04-13 22:00:19,402 INFO L226 Difference]: Without dead ends: 20309 [2025-04-13 22:00:19,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:00:19,432 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4032 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:19,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 4064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4032 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 22:00:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20309 states. [2025-04-13 22:00:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20309 to 19503. [2025-04-13 22:00:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19503 states, 19486 states have (on average 3.1463614903007286) internal successors, (61310), 19502 states have internal predecessors, (61310), 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 22:00:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 61310 transitions. [2025-04-13 22:00:20,487 INFO L79 Accepts]: Start accepts. Automaton has 19503 states and 61310 transitions. Word has length 40 [2025-04-13 22:00:20,487 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:20,487 INFO L485 AbstractCegarLoop]: Abstraction has 19503 states and 61310 transitions. [2025-04-13 22:00:20,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:20,488 INFO L278 IsEmpty]: Start isEmpty. Operand 19503 states and 61310 transitions. [2025-04-13 22:00:20,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:20,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:20,493 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:20,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 22:00:20,493 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:20,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash -264131618, now seen corresponding path program 3 times [2025-04-13 22:00:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:20,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126739971] [2025-04-13 22:00:20,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:20,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:00:20,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:00:20,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:00:20,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:22,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:22,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126739971] [2025-04-13 22:00:22,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126739971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:00:22,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:00:22,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:00:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081866525] [2025-04-13 22:00:22,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:00:22,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:00:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:22,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:00:22,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:00:22,158 INFO L87 Difference]: Start difference. First operand 19503 states and 61310 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:26,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:26,134 INFO L93 Difference]: Finished difference Result 35543 states and 111520 transitions. [2025-04-13 22:00:26,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:00:26,135 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:26,135 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:26,735 INFO L225 Difference]: With dead ends: 35543 [2025-04-13 22:00:26,736 INFO L226 Difference]: Without dead ends: 20657 [2025-04-13 22:00:26,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:00:26,765 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4372 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:26,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 4429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4372 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 22:00:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20657 states. [2025-04-13 22:00:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20657 to 19411. [2025-04-13 22:00:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19411 states, 19394 states have (on average 3.143033928018975) internal successors, (60956), 19410 states have internal predecessors, (60956), 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 22:00:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19411 states to 19411 states and 60956 transitions. [2025-04-13 22:00:27,674 INFO L79 Accepts]: Start accepts. Automaton has 19411 states and 60956 transitions. Word has length 40 [2025-04-13 22:00:27,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:27,674 INFO L485 AbstractCegarLoop]: Abstraction has 19411 states and 60956 transitions. [2025-04-13 22:00:27,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:27,674 INFO L278 IsEmpty]: Start isEmpty. Operand 19411 states and 60956 transitions. [2025-04-13 22:00:27,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:27,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:27,680 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:27,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 22:00:27,680 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:27,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1850688284, now seen corresponding path program 6 times [2025-04-13 22:00:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:27,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273870386] [2025-04-13 22:00:27,680 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:27,865 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:00:27,877 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:00:27,877 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:00:27,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:29,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273870386] [2025-04-13 22:00:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273870386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:00:29,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:00:29,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:00:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939020847] [2025-04-13 22:00:29,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:00:29,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:00:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:29,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:00:29,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:00:29,469 INFO L87 Difference]: Start difference. First operand 19411 states and 60956 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:32,852 INFO L93 Difference]: Finished difference Result 34740 states and 109027 transitions. [2025-04-13 22:00:32,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:00:32,852 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:32,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:33,611 INFO L225 Difference]: With dead ends: 34740 [2025-04-13 22:00:33,611 INFO L226 Difference]: Without dead ends: 20361 [2025-04-13 22:00:33,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:00:33,643 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3523 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:33,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 3569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3523 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 22:00:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2025-04-13 22:00:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 19417. [2025-04-13 22:00:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19417 states, 19400 states have (on average 3.142886597938144) internal successors, (60972), 19416 states have internal predecessors, (60972), 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 22:00:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19417 states to 19417 states and 60972 transitions. [2025-04-13 22:00:34,558 INFO L79 Accepts]: Start accepts. Automaton has 19417 states and 60972 transitions. Word has length 40 [2025-04-13 22:00:34,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:34,558 INFO L485 AbstractCegarLoop]: Abstraction has 19417 states and 60972 transitions. [2025-04-13 22:00:34,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:34,558 INFO L278 IsEmpty]: Start isEmpty. Operand 19417 states and 60972 transitions. [2025-04-13 22:00:34,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:34,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:34,563 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:34,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 22:00:34,564 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:34,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1826658448, now seen corresponding path program 7 times [2025-04-13 22:00:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:34,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845621674] [2025-04-13 22:00:34,564 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:34,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:34,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:00:34,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:00:34,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:34,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:36,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845621674] [2025-04-13 22:00:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845621674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:00:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:00:36,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 22:00:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152502825] [2025-04-13 22:00:36,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:00:36,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:00:36,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:36,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:00:36,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:00:36,682 INFO L87 Difference]: Start difference. First operand 19417 states and 60972 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:42,685 INFO L93 Difference]: Finished difference Result 37667 states and 117318 transitions. [2025-04-13 22:00:42,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 22:00:42,685 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:42,686 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:43,277 INFO L225 Difference]: With dead ends: 37667 [2025-04-13 22:00:43,277 INFO L226 Difference]: Without dead ends: 23731 [2025-04-13 22:00:43,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=1891, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:00:43,299 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 425 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6113 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 6113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:43,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 0 Invalid, 6241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 6113 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-04-13 22:00:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23731 states. [2025-04-13 22:00:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23731 to 19642. [2025-04-13 22:00:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19642 states, 19625 states have (on average 3.143643312101911) internal successors, (61694), 19641 states have internal predecessors, (61694), 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 22:00:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19642 states to 19642 states and 61694 transitions. [2025-04-13 22:00:44,239 INFO L79 Accepts]: Start accepts. Automaton has 19642 states and 61694 transitions. Word has length 40 [2025-04-13 22:00:44,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:44,240 INFO L485 AbstractCegarLoop]: Abstraction has 19642 states and 61694 transitions. [2025-04-13 22:00:44,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:44,240 INFO L278 IsEmpty]: Start isEmpty. Operand 19642 states and 61694 transitions. [2025-04-13 22:00:44,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:44,245 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:44,245 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:44,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 22:00:44,245 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:44,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash -705221166, now seen corresponding path program 4 times [2025-04-13 22:00:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:44,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079680438] [2025-04-13 22:00:44,246 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:44,281 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:00:44,304 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:00:44,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:44,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:45,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079680438] [2025-04-13 22:00:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079680438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:00:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:00:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:00:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565117407] [2025-04-13 22:00:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:00:45,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:00:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:45,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:00:45,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:00:45,999 INFO L87 Difference]: Start difference. First operand 19642 states and 61694 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:49,684 INFO L93 Difference]: Finished difference Result 35334 states and 110842 transitions. [2025-04-13 22:00:49,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:00:49,684 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:49,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:50,338 INFO L225 Difference]: With dead ends: 35334 [2025-04-13 22:00:50,338 INFO L226 Difference]: Without dead ends: 20756 [2025-04-13 22:00:50,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:00:50,369 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:50,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 4078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 22:00:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20756 states. [2025-04-13 22:00:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20756 to 19648. [2025-04-13 22:00:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19648 states, 19631 states have (on average 3.1434975294177576) internal successors, (61710), 19647 states have internal predecessors, (61710), 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 22:00:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19648 states to 19648 states and 61710 transitions. [2025-04-13 22:00:51,289 INFO L79 Accepts]: Start accepts. Automaton has 19648 states and 61710 transitions. Word has length 40 [2025-04-13 22:00:51,289 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:51,289 INFO L485 AbstractCegarLoop]: Abstraction has 19648 states and 61710 transitions. [2025-04-13 22:00:51,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:51,290 INFO L278 IsEmpty]: Start isEmpty. Operand 19648 states and 61710 transitions. [2025-04-13 22:00:51,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:51,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:51,295 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:51,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 22:00:51,295 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:51,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash 587449442, now seen corresponding path program 8 times [2025-04-13 22:00:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:51,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902925525] [2025-04-13 22:00:51,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:51,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:51,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:00:51,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:00:51,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:00:51,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:53,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902925525] [2025-04-13 22:00:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902925525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:00:53,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:00:53,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:00:53,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167052644] [2025-04-13 22:00:53,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:00:53,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:00:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:53,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:00:53,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:00:53,097 INFO L87 Difference]: Start difference. First operand 19648 states and 61710 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:56,993 INFO L93 Difference]: Finished difference Result 35344 states and 110864 transitions. [2025-04-13 22:00:56,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:00:56,993 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:00:56,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:57,612 INFO L225 Difference]: With dead ends: 35344 [2025-04-13 22:00:57,612 INFO L226 Difference]: Without dead ends: 20822 [2025-04-13 22:00:57,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:00:57,642 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 325 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4179 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:57,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 0 Invalid, 4227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4179 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 22:00:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20822 states. [2025-04-13 22:00:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20822 to 19660. [2025-04-13 22:00:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19660 states, 19643 states have (on average 3.1432062312274094) internal successors, (61742), 19659 states have internal predecessors, (61742), 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 22:00:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19660 states to 19660 states and 61742 transitions. [2025-04-13 22:00:58,574 INFO L79 Accepts]: Start accepts. Automaton has 19660 states and 61742 transitions. Word has length 40 [2025-04-13 22:00:58,575 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:58,575 INFO L485 AbstractCegarLoop]: Abstraction has 19660 states and 61742 transitions. [2025-04-13 22:00:58,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:58,575 INFO L278 IsEmpty]: Start isEmpty. Operand 19660 states and 61742 transitions. [2025-04-13 22:00:58,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:00:58,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:58,580 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:58,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 22:00:58,580 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:00:58,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 441085096, now seen corresponding path program 9 times [2025-04-13 22:00:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:58,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414742569] [2025-04-13 22:00:58,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:58,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:00:58,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:00:58,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:00:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:00,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414742569] [2025-04-13 22:01:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414742569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:00,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:00,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:01:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433521736] [2025-04-13 22:01:00,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:00,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:00,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:00,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:00,643 INFO L87 Difference]: Start difference. First operand 19660 states and 61742 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:04,514 INFO L93 Difference]: Finished difference Result 35178 states and 110357 transitions. [2025-04-13 22:01:04,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:01:04,515 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:01:04,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:05,121 INFO L225 Difference]: With dead ends: 35178 [2025-04-13 22:01:05,121 INFO L226 Difference]: Without dead ends: 20648 [2025-04-13 22:01:05,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:01:05,149 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4211 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:05,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 4263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4211 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 22:01:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20648 states. [2025-04-13 22:01:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20648 to 19678. [2025-04-13 22:01:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19678 states, 19661 states have (on average 3.1427699506637508) internal successors, (61790), 19677 states have internal predecessors, (61790), 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 22:01:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19678 states to 19678 states and 61790 transitions. [2025-04-13 22:01:06,061 INFO L79 Accepts]: Start accepts. Automaton has 19678 states and 61790 transitions. Word has length 40 [2025-04-13 22:01:06,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:06,061 INFO L485 AbstractCegarLoop]: Abstraction has 19678 states and 61790 transitions. [2025-04-13 22:01:06,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:06,061 INFO L278 IsEmpty]: Start isEmpty. Operand 19678 states and 61790 transitions. [2025-04-13 22:01:06,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:01:06,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:06,067 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:06,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 22:01:06,067 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:01:06,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash 407856630, now seen corresponding path program 5 times [2025-04-13 22:01:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:06,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248427895] [2025-04-13 22:01:06,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:06,098 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:01:06,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:01:06,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:01:06,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:08,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:08,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248427895] [2025-04-13 22:01:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248427895] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:08,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:08,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:01:08,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835754142] [2025-04-13 22:01:08,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:08,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:08,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:08,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:08,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:08,357 INFO L87 Difference]: Start difference. First operand 19678 states and 61790 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:12,608 INFO L93 Difference]: Finished difference Result 35470 states and 111191 transitions. [2025-04-13 22:01:12,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:01:12,608 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:01:12,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:13,220 INFO L225 Difference]: With dead ends: 35470 [2025-04-13 22:01:13,221 INFO L226 Difference]: Without dead ends: 20868 [2025-04-13 22:01:13,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:01:13,250 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4713 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:13,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 4767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4713 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 22:01:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20868 states. [2025-04-13 22:01:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20868 to 19684. [2025-04-13 22:01:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19684 states, 19667 states have (on average 3.1426247012762496) internal successors, (61806), 19683 states have internal predecessors, (61806), 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 22:01:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19684 states to 19684 states and 61806 transitions. [2025-04-13 22:01:14,225 INFO L79 Accepts]: Start accepts. Automaton has 19684 states and 61806 transitions. Word has length 40 [2025-04-13 22:01:14,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:14,225 INFO L485 AbstractCegarLoop]: Abstraction has 19684 states and 61806 transitions. [2025-04-13 22:01:14,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:14,225 INFO L278 IsEmpty]: Start isEmpty. Operand 19684 states and 61806 transitions. [2025-04-13 22:01:14,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:01:14,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:14,230 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:14,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 22:01:14,231 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:01:14,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash -237048890, now seen corresponding path program 10 times [2025-04-13 22:01:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:14,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792182097] [2025-04-13 22:01:14,231 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:01:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:14,262 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:01:14,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:01:14,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:01:14,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:16,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792182097] [2025-04-13 22:01:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792182097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:16,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:16,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:01:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460175827] [2025-04-13 22:01:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:16,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:16,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:16,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:16,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:16,078 INFO L87 Difference]: Start difference. First operand 19684 states and 61806 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:20,715 INFO L93 Difference]: Finished difference Result 35356 states and 110857 transitions. [2025-04-13 22:01:20,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:01:20,716 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:01:20,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:21,367 INFO L225 Difference]: With dead ends: 35356 [2025-04-13 22:01:21,367 INFO L226 Difference]: Without dead ends: 20810 [2025-04-13 22:01:21,397 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:01:21,397 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4732 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:21,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 4786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4732 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 22:01:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20810 states. [2025-04-13 22:01:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20810 to 19672. [2025-04-13 22:01:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19672 states, 19655 states have (on average 3.142915288730603) internal successors, (61774), 19671 states have internal predecessors, (61774), 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 22:01:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19672 states to 19672 states and 61774 transitions. [2025-04-13 22:01:22,601 INFO L79 Accepts]: Start accepts. Automaton has 19672 states and 61774 transitions. Word has length 40 [2025-04-13 22:01:22,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:22,601 INFO L485 AbstractCegarLoop]: Abstraction has 19672 states and 61774 transitions. [2025-04-13 22:01:22,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:22,601 INFO L278 IsEmpty]: Start isEmpty. Operand 19672 states and 61774 transitions. [2025-04-13 22:01:22,607 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:01:22,607 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:22,607 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:22,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 22:01:22,607 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:01:22,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 281988676, now seen corresponding path program 6 times [2025-04-13 22:01:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:22,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357365294] [2025-04-13 22:01:22,608 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:22,640 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:01:22,666 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:01:22,666 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:01:22,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:24,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357365294] [2025-04-13 22:01:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357365294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:01:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889438192] [2025-04-13 22:01:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:24,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:24,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:24,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:24,613 INFO L87 Difference]: Start difference. First operand 19672 states and 61774 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:28,801 INFO L93 Difference]: Finished difference Result 35438 states and 111107 transitions. [2025-04-13 22:01:28,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:01:28,801 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:01:28,801 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:29,464 INFO L225 Difference]: With dead ends: 35438 [2025-04-13 22:01:29,464 INFO L226 Difference]: Without dead ends: 20840 [2025-04-13 22:01:29,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:01:29,496 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4329 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:29,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 4371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4329 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 22:01:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20840 states. [2025-04-13 22:01:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20840 to 19684. [2025-04-13 22:01:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19684 states, 19667 states have (on average 3.1426247012762496) internal successors, (61806), 19683 states have internal predecessors, (61806), 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 22:01:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19684 states to 19684 states and 61806 transitions. [2025-04-13 22:01:30,506 INFO L79 Accepts]: Start accepts. Automaton has 19684 states and 61806 transitions. Word has length 40 [2025-04-13 22:01:30,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:30,507 INFO L485 AbstractCegarLoop]: Abstraction has 19684 states and 61806 transitions. [2025-04-13 22:01:30,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:30,507 INFO L278 IsEmpty]: Start isEmpty. Operand 19684 states and 61806 transitions. [2025-04-13 22:01:30,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:01:30,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:30,513 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:30,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 22:01:30,513 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:01:30,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash -362916844, now seen corresponding path program 11 times [2025-04-13 22:01:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:30,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468290384] [2025-04-13 22:01:30,513 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:30,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:01:30,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:01:30,566 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:01:30,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:32,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468290384] [2025-04-13 22:01:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468290384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:32,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:32,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-04-13 22:01:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341898386] [2025-04-13 22:01:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:32,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:01:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:32,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:01:32,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:01:32,748 INFO L87 Difference]: Start difference. First operand 19684 states and 61806 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:38,021 INFO L93 Difference]: Finished difference Result 39967 states and 124229 transitions. [2025-04-13 22:01:38,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 22:01:38,022 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:01:38,022 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:38,683 INFO L225 Difference]: With dead ends: 39967 [2025-04-13 22:01:38,684 INFO L226 Difference]: Without dead ends: 25868 [2025-04-13 22:01:38,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=421, Invalid=2549, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:01:38,716 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 545 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:38,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 0 Invalid, 5071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 4925 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 22:01:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25868 states. [2025-04-13 22:01:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25868 to 19828. [2025-04-13 22:01:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19828 states, 19811 states have (on average 3.141083236585735) internal successors, (62228), 19827 states have internal predecessors, (62228), 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 22:01:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19828 states to 19828 states and 62228 transitions. [2025-04-13 22:01:39,739 INFO L79 Accepts]: Start accepts. Automaton has 19828 states and 62228 transitions. Word has length 40 [2025-04-13 22:01:39,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:39,739 INFO L485 AbstractCegarLoop]: Abstraction has 19828 states and 62228 transitions. [2025-04-13 22:01:39,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:39,740 INFO L278 IsEmpty]: Start isEmpty. Operand 19828 states and 62228 transitions. [2025-04-13 22:01:39,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:01:39,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:39,745 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:39,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 22:01:39,745 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:01:39,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1598870730, now seen corresponding path program 7 times [2025-04-13 22:01:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:39,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165501174] [2025-04-13 22:01:39,746 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:01:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:39,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:01:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:01:39,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:01:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:42,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:42,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165501174] [2025-04-13 22:01:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165501174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:01:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260042835] [2025-04-13 22:01:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:42,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:42,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:42,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:42,071 INFO L87 Difference]: Start difference. First operand 19828 states and 62228 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:45,898 INFO L93 Difference]: Finished difference Result 35692 states and 111848 transitions. [2025-04-13 22:01:45,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:01:45,898 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:01:45,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:46,631 INFO L225 Difference]: With dead ends: 35692 [2025-04-13 22:01:46,631 INFO L226 Difference]: Without dead ends: 20990 [2025-04-13 22:01:46,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:01:46,666 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:46,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 3694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 22:01:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20990 states. [2025-04-13 22:01:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20990 to 19822. [2025-04-13 22:01:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19822 states, 19805 states have (on average 3.1412269628881595) internal successors, (62212), 19821 states have internal predecessors, (62212), 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 22:01:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19822 states to 19822 states and 62212 transitions. [2025-04-13 22:01:47,766 INFO L79 Accepts]: Start accepts. Automaton has 19822 states and 62212 transitions. Word has length 40 [2025-04-13 22:01:47,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:47,766 INFO L485 AbstractCegarLoop]: Abstraction has 19822 states and 62212 transitions. [2025-04-13 22:01:47,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:47,767 INFO L278 IsEmpty]: Start isEmpty. Operand 19822 states and 62212 transitions. [2025-04-13 22:01:47,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:01:47,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:47,773 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:47,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 22:01:47,773 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:01:47,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1328080918, now seen corresponding path program 8 times [2025-04-13 22:01:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:47,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887587190] [2025-04-13 22:01:47,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:01:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:47,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:01:47,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:01:47,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:01:47,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:49,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887587190] [2025-04-13 22:01:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887587190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:49,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:49,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:01:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403348186] [2025-04-13 22:01:49,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:49,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:49,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:49,673 INFO L87 Difference]: Start difference. First operand 19822 states and 62212 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:54,944 INFO L93 Difference]: Finished difference Result 35620 states and 111653 transitions. [2025-04-13 22:01:54,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:01:54,944 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:01:54,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:55,645 INFO L225 Difference]: With dead ends: 35620 [2025-04-13 22:01:55,645 INFO L226 Difference]: Without dead ends: 20922 [2025-04-13 22:01:55,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:01:55,682 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5809 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 5809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:55,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 5849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 5809 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-04-13 22:01:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20922 states. [2025-04-13 22:01:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20922 to 19810. [2025-04-13 22:01:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19810 states, 19793 states have (on average 3.141514676905977) internal successors, (62180), 19809 states have internal predecessors, (62180), 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 22:01:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19810 states to 19810 states and 62180 transitions. [2025-04-13 22:01:56,674 INFO L79 Accepts]: Start accepts. Automaton has 19810 states and 62180 transitions. Word has length 40 [2025-04-13 22:01:56,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:56,674 INFO L485 AbstractCegarLoop]: Abstraction has 19810 states and 62180 transitions. [2025-04-13 22:01:56,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:56,674 INFO L278 IsEmpty]: Start isEmpty. Operand 19810 states and 62180 transitions. [2025-04-13 22:01:56,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:01:56,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:56,680 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:56,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 22:01:56,680 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:01:56,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash 8832260, now seen corresponding path program 12 times [2025-04-13 22:01:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:56,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476479737] [2025-04-13 22:01:56,681 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:56,713 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:01:56,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:01:56,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:01:56,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:58,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476479737] [2025-04-13 22:01:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476479737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:01:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:01:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 22:01:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129892018] [2025-04-13 22:01:58,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:01:58,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:01:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:58,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:01:58,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:01:58,072 INFO L87 Difference]: Start difference. First operand 19810 states and 62180 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:01,736 INFO L93 Difference]: Finished difference Result 35584 states and 111770 transitions. [2025-04-13 22:02:01,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:02:01,736 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:02:01,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:02,430 INFO L225 Difference]: With dead ends: 35584 [2025-04-13 22:02:02,430 INFO L226 Difference]: Without dead ends: 20430 [2025-04-13 22:02:02,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:02:02,464 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3924 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:02,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3924 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 22:02:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2025-04-13 22:02:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 19736. [2025-04-13 22:02:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19736 states, 19719 states have (on average 3.1415386175769564) internal successors, (61948), 19735 states have internal predecessors, (61948), 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 22:02:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19736 states to 19736 states and 61948 transitions. [2025-04-13 22:02:03,482 INFO L79 Accepts]: Start accepts. Automaton has 19736 states and 61948 transitions. Word has length 40 [2025-04-13 22:02:03,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:03,482 INFO L485 AbstractCegarLoop]: Abstraction has 19736 states and 61948 transitions. [2025-04-13 22:02:03,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:03,482 INFO L278 IsEmpty]: Start isEmpty. Operand 19736 states and 61948 transitions. [2025-04-13 22:02:03,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:02:03,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:03,488 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:03,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 22:02:03,488 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:02:03,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash 278585700, now seen corresponding path program 9 times [2025-04-13 22:02:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:03,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281184752] [2025-04-13 22:02:03,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:02:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:03,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:02:03,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:02:03,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:02:03,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:02:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:05,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281184752] [2025-04-13 22:02:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281184752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:02:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:02:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:02:05,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532910174] [2025-04-13 22:02:05,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:02:05,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:02:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:05,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:02:05,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:02:05,435 INFO L87 Difference]: Start difference. First operand 19736 states and 61948 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:09,348 INFO L93 Difference]: Finished difference Result 35328 states and 110770 transitions. [2025-04-13 22:02:09,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:02:09,348 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:02:09,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:10,152 INFO L225 Difference]: With dead ends: 35328 [2025-04-13 22:02:10,152 INFO L226 Difference]: Without dead ends: 20674 [2025-04-13 22:02:10,181 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:02:10,181 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3908 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:10,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3908 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 22:02:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20674 states. [2025-04-13 22:02:10,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20674 to 19730. [2025-04-13 22:02:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19730 states, 19713 states have (on average 3.141683153249125) internal successors, (61932), 19729 states have internal predecessors, (61932), 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 22:02:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19730 states to 19730 states and 61932 transitions. [2025-04-13 22:02:11,292 INFO L79 Accepts]: Start accepts. Automaton has 19730 states and 61932 transitions. Word has length 40 [2025-04-13 22:02:11,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:11,293 INFO L485 AbstractCegarLoop]: Abstraction has 19730 states and 61932 transitions. [2025-04-13 22:02:11,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:11,293 INFO L278 IsEmpty]: Start isEmpty. Operand 19730 states and 61932 transitions. [2025-04-13 22:02:11,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:02:11,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:11,298 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:11,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 22:02:11,299 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:02:11,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1969495322, now seen corresponding path program 13 times [2025-04-13 22:02:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:11,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758501744] [2025-04-13 22:02:11,299 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:02:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:11,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:02:11,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:02:11,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:02:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:02:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:13,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758501744] [2025-04-13 22:02:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758501744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:02:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:02:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:02:13,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655009551] [2025-04-13 22:02:13,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:02:13,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:02:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:13,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:02:13,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:02:13,145 INFO L87 Difference]: Start difference. First operand 19730 states and 61932 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:17,602 INFO L93 Difference]: Finished difference Result 35312 states and 110767 transitions. [2025-04-13 22:02:17,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:02:17,602 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:02:17,602 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:18,353 INFO L225 Difference]: With dead ends: 35312 [2025-04-13 22:02:18,353 INFO L226 Difference]: Without dead ends: 20722 [2025-04-13 22:02:18,389 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:02:18,390 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4384 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:18,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 4441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4384 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 22:02:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20722 states. [2025-04-13 22:02:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20722 to 19724. [2025-04-13 22:02:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19724 states, 19707 states have (on average 3.1418277769320544) internal successors, (61916), 19723 states have internal predecessors, (61916), 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 22:02:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19724 states to 19724 states and 61916 transitions. [2025-04-13 22:02:19,416 INFO L79 Accepts]: Start accepts. Automaton has 19724 states and 61916 transitions. Word has length 40 [2025-04-13 22:02:19,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:19,416 INFO L485 AbstractCegarLoop]: Abstraction has 19724 states and 61916 transitions. [2025-04-13 22:02:19,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:19,416 INFO L278 IsEmpty]: Start isEmpty. Operand 19724 states and 61916 transitions. [2025-04-13 22:02:19,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:02:19,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:19,422 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:19,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 22:02:19,422 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:02:19,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1309272, now seen corresponding path program 10 times [2025-04-13 22:02:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:19,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521537192] [2025-04-13 22:02:19,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:02:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:19,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:02:19,477 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:02:19,477 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:02:19,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:02:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:22,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521537192] [2025-04-13 22:02:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521537192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:02:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:02:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:02:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680947866] [2025-04-13 22:02:22,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:02:22,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:02:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:22,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:02:22,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:02:22,250 INFO L87 Difference]: Start difference. First operand 19724 states and 61916 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:26,936 INFO L93 Difference]: Finished difference Result 36368 states and 114171 transitions. [2025-04-13 22:02:26,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:02:26,936 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:02:26,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:27,725 INFO L225 Difference]: With dead ends: 36368 [2025-04-13 22:02:27,726 INFO L226 Difference]: Without dead ends: 21262 [2025-04-13 22:02:27,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:02:27,751 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4843 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:27,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4843 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 22:02:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21262 states. [2025-04-13 22:02:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21262 to 19736. [2025-04-13 22:02:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19736 states, 19719 states have (on average 3.1415386175769564) internal successors, (61948), 19735 states have internal predecessors, (61948), 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 22:02:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19736 states to 19736 states and 61948 transitions. [2025-04-13 22:02:28,899 INFO L79 Accepts]: Start accepts. Automaton has 19736 states and 61948 transitions. Word has length 40 [2025-04-13 22:02:28,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:28,899 INFO L485 AbstractCegarLoop]: Abstraction has 19736 states and 61948 transitions. [2025-04-13 22:02:28,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:28,899 INFO L278 IsEmpty]: Start isEmpty. Operand 19736 states and 61948 transitions. [2025-04-13 22:02:28,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:02:28,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:28,906 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:28,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 22:02:28,906 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:02:28,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1291361336, now seen corresponding path program 14 times [2025-04-13 22:02:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:28,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390898164] [2025-04-13 22:02:28,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:02:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:28,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:02:28,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:02:28,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:02:28,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:02:31,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:31,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390898164] [2025-04-13 22:02:31,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390898164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:02:31,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:02:31,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 22:02:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981179669] [2025-04-13 22:02:31,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:02:31,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:02:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:31,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:02:31,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:02:31,755 INFO L87 Difference]: Start difference. First operand 19736 states and 61948 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:42,495 INFO L93 Difference]: Finished difference Result 41111 states and 129567 transitions. [2025-04-13 22:02:42,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 22:02:42,496 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:02:42,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:43,201 INFO L225 Difference]: With dead ends: 41111 [2025-04-13 22:02:43,202 INFO L226 Difference]: Without dead ends: 27354 [2025-04-13 22:02:43,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=535, Invalid=3887, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 22:02:43,236 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 751 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8993 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 8993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:43,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 0 Invalid, 9231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 8993 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2025-04-13 22:02:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27354 states. [2025-04-13 22:02:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27354 to 19850. [2025-04-13 22:02:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19850 states, 19833 states have (on average 3.144456209348056) internal successors, (62364), 19849 states have internal predecessors, (62364), 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 22:02:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19850 states to 19850 states and 62364 transitions. [2025-04-13 22:02:44,493 INFO L79 Accepts]: Start accepts. Automaton has 19850 states and 62364 transitions. Word has length 40 [2025-04-13 22:02:44,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:44,493 INFO L485 AbstractCegarLoop]: Abstraction has 19850 states and 62364 transitions. [2025-04-13 22:02:44,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:44,494 INFO L278 IsEmpty]: Start isEmpty. Operand 19850 states and 62364 transitions. [2025-04-13 22:02:44,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:02:44,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:44,499 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:44,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 22:02:44,500 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:02:44,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:44,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1882168678, now seen corresponding path program 11 times [2025-04-13 22:02:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:44,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784624102] [2025-04-13 22:02:44,500 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:02:44,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:44,533 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:02:44,805 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:02:44,805 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:02:44,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:02:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:47,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784624102] [2025-04-13 22:02:47,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784624102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:02:47,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:02:47,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:02:47,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266625462] [2025-04-13 22:02:47,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:02:47,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:02:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:47,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:02:47,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:02:47,159 INFO L87 Difference]: Start difference. First operand 19850 states and 62364 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:51,456 INFO L93 Difference]: Finished difference Result 35758 states and 112084 transitions. [2025-04-13 22:02:51,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:02:51,456 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:02:51,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:52,141 INFO L225 Difference]: With dead ends: 35758 [2025-04-13 22:02:52,141 INFO L226 Difference]: Without dead ends: 21066 [2025-04-13 22:02:52,172 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:02:52,173 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 311 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4118 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 4118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:52,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 0 Invalid, 4197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 4118 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 22:02:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21066 states. [2025-04-13 22:02:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21066 to 19718. [2025-04-13 22:02:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19718 states, 19701 states have (on average 3.141972488706157) internal successors, (61900), 19717 states have internal predecessors, (61900), 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 22:02:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19718 states to 19718 states and 61900 transitions. [2025-04-13 22:02:53,355 INFO L79 Accepts]: Start accepts. Automaton has 19718 states and 61900 transitions. Word has length 40 [2025-04-13 22:02:53,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:53,356 INFO L485 AbstractCegarLoop]: Abstraction has 19718 states and 61900 transitions. [2025-04-13 22:02:53,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:53,356 INFO L278 IsEmpty]: Start isEmpty. Operand 19718 states and 61900 transitions. [2025-04-13 22:02:53,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:02:53,362 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:53,362 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:53,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 22:02:53,362 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:02:53,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1305872810, now seen corresponding path program 12 times [2025-04-13 22:02:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:53,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543074810] [2025-04-13 22:02:53,363 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:02:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:53,396 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:02:53,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:02:53,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:02:53,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:02:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:55,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543074810] [2025-04-13 22:02:55,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543074810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:02:55,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:02:55,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:02:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637862648] [2025-04-13 22:02:55,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:02:55,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:02:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:55,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:02:55,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:02:55,058 INFO L87 Difference]: Start difference. First operand 19718 states and 61900 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:00,323 INFO L93 Difference]: Finished difference Result 35602 states and 111747 transitions. [2025-04-13 22:03:00,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:03:00,323 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:00,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:01,021 INFO L225 Difference]: With dead ends: 35602 [2025-04-13 22:03:01,021 INFO L226 Difference]: Without dead ends: 20960 [2025-04-13 22:03:01,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:03:01,054 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5210 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 5210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:01,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 5269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 5210 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-04-13 22:03:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20960 states. [2025-04-13 22:03:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20960 to 19700. [2025-04-13 22:03:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19700 states, 19683 states have (on average 3.1424071533810904) internal successors, (61852), 19699 states have internal predecessors, (61852), 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 22:03:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19700 states to 19700 states and 61852 transitions. [2025-04-13 22:03:02,083 INFO L79 Accepts]: Start accepts. Automaton has 19700 states and 61852 transitions. Word has length 40 [2025-04-13 22:03:02,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:03:02,084 INFO L485 AbstractCegarLoop]: Abstraction has 19700 states and 61852 transitions. [2025-04-13 22:03:02,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:02,084 INFO L278 IsEmpty]: Start isEmpty. Operand 19700 states and 61852 transitions. [2025-04-13 22:03:02,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:03:02,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:03:02,089 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:03:02,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 22:03:02,090 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:03:02,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:03:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash 357906582, now seen corresponding path program 15 times [2025-04-13 22:03:02,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:03:02,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340810538] [2025-04-13 22:03:02,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:03:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:03:02,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:03:02,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:03:02,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:03:02,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:03:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:03:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:03:03,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340810538] [2025-04-13 22:03:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340810538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:03:03,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:03:03,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:03:03,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648363801] [2025-04-13 22:03:03,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:03:03,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:03:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:03,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:03:03,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:03:03,947 INFO L87 Difference]: Start difference. First operand 19700 states and 61852 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:08,417 INFO L93 Difference]: Finished difference Result 35460 states and 111166 transitions. [2025-04-13 22:03:08,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:03:08,417 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:08,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:09,100 INFO L225 Difference]: With dead ends: 35460 [2025-04-13 22:03:09,100 INFO L226 Difference]: Without dead ends: 20890 [2025-04-13 22:03:09,130 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:03:09,130 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4652 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:09,130 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4652 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 22:03:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20890 states. [2025-04-13 22:03:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20890 to 19694. [2025-04-13 22:03:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19694 states, 19677 states have (on average 3.142552218325964) internal successors, (61836), 19693 states have internal predecessors, (61836), 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 22:03:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19694 states to 19694 states and 61836 transitions. [2025-04-13 22:03:10,234 INFO L79 Accepts]: Start accepts. Automaton has 19694 states and 61836 transitions. Word has length 40 [2025-04-13 22:03:10,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:03:10,234 INFO L485 AbstractCegarLoop]: Abstraction has 19694 states and 61836 transitions. [2025-04-13 22:03:10,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:10,234 INFO L278 IsEmpty]: Start isEmpty. Operand 19694 states and 61836 transitions. [2025-04-13 22:03:10,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:03:10,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:03:10,241 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:03:10,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 22:03:10,241 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:03:10,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:03:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1728694774, now seen corresponding path program 16 times [2025-04-13 22:03:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:03:10,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86423315] [2025-04-13 22:03:10,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:03:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:03:10,289 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:03:10,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:03:10,333 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:03:10,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:03:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:03:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:03:13,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86423315] [2025-04-13 22:03:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86423315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:03:13,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:03:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 22:03:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703023526] [2025-04-13 22:03:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:03:13,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:03:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:13,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:03:13,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:03:13,334 INFO L87 Difference]: Start difference. First operand 19694 states and 61836 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:19,153 INFO L93 Difference]: Finished difference Result 38339 states and 119417 transitions. [2025-04-13 22:03:19,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:03:19,154 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:19,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:19,836 INFO L225 Difference]: With dead ends: 38339 [2025-04-13 22:03:19,836 INFO L226 Difference]: Without dead ends: 24220 [2025-04-13 22:03:19,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=437, Invalid=2215, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:03:19,865 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 489 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5399 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 5399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:19,865 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 0 Invalid, 5550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 5399 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-04-13 22:03:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24220 states. [2025-04-13 22:03:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24220 to 19838. [2025-04-13 22:03:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19838 states, 19821 states have (on average 3.1410120579183696) internal successors, (62258), 19837 states have internal predecessors, (62258), 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 22:03:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19838 states to 19838 states and 62258 transitions. [2025-04-13 22:03:20,917 INFO L79 Accepts]: Start accepts. Automaton has 19838 states and 62258 transitions. Word has length 40 [2025-04-13 22:03:20,917 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:03:20,917 INFO L485 AbstractCegarLoop]: Abstraction has 19838 states and 62258 transitions. [2025-04-13 22:03:20,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:20,917 INFO L278 IsEmpty]: Start isEmpty. Operand 19838 states and 62258 transitions. [2025-04-13 22:03:20,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:03:20,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:03:20,923 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:03:20,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 22:03:20,923 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:03:20,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:03:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash -607257492, now seen corresponding path program 13 times [2025-04-13 22:03:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:03:20,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477759744] [2025-04-13 22:03:20,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:03:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:03:20,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:03:20,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:03:20,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:03:20,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:03:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:03:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:03:22,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477759744] [2025-04-13 22:03:22,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477759744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:03:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:03:22,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:03:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348589448] [2025-04-13 22:03:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:03:22,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:03:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:22,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:03:22,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:03:22,914 INFO L87 Difference]: Start difference. First operand 19838 states and 62258 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:27,266 INFO L93 Difference]: Finished difference Result 35680 states and 111825 transitions. [2025-04-13 22:03:27,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:03:27,267 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:27,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:27,982 INFO L225 Difference]: With dead ends: 35680 [2025-04-13 22:03:27,982 INFO L226 Difference]: Without dead ends: 20958 [2025-04-13 22:03:28,012 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:03:28,013 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4268 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:28,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 4320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4268 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 22:03:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20958 states. [2025-04-13 22:03:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20958 to 19832. [2025-04-13 22:03:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19832 states, 19815 states have (on average 3.141155690133737) internal successors, (62242), 19831 states have internal predecessors, (62242), 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 22:03:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19832 states to 19832 states and 62242 transitions. [2025-04-13 22:03:29,128 INFO L79 Accepts]: Start accepts. Automaton has 19832 states and 62242 transitions. Word has length 40 [2025-04-13 22:03:29,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:03:29,128 INFO L485 AbstractCegarLoop]: Abstraction has 19832 states and 62242 transitions. [2025-04-13 22:03:29,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:29,128 INFO L278 IsEmpty]: Start isEmpty. Operand 19832 states and 62242 transitions. [2025-04-13 22:03:29,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:03:29,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:03:29,134 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:03:29,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 22:03:29,134 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:03:29,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:03:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1579029226, now seen corresponding path program 17 times [2025-04-13 22:03:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:03:29,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029433964] [2025-04-13 22:03:29,135 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:03:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:03:29,169 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:03:29,181 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:03:29,181 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:03:29,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:03:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:03:30,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:03:30,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029433964] [2025-04-13 22:03:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029433964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:03:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:03:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 22:03:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9642409] [2025-04-13 22:03:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:03:30,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:03:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:30,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:03:30,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:03:30,865 INFO L87 Difference]: Start difference. First operand 19832 states and 62242 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:34,203 INFO L93 Difference]: Finished difference Result 35722 states and 112142 transitions. [2025-04-13 22:03:34,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:03:34,203 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:34,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:34,989 INFO L225 Difference]: With dead ends: 35722 [2025-04-13 22:03:34,989 INFO L226 Difference]: Without dead ends: 20544 [2025-04-13 22:03:35,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:03:35,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:35,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3244 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 22:03:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20544 states. [2025-04-13 22:03:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20544 to 19806. [2025-04-13 22:03:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19806 states, 19789 states have (on average 3.1416443478700287) internal successors, (62170), 19805 states have internal predecessors, (62170), 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 22:03:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19806 states to 19806 states and 62170 transitions. [2025-04-13 22:03:36,151 INFO L79 Accepts]: Start accepts. Automaton has 19806 states and 62170 transitions. Word has length 40 [2025-04-13 22:03:36,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:03:36,152 INFO L485 AbstractCegarLoop]: Abstraction has 19806 states and 62170 transitions. [2025-04-13 22:03:36,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:36,152 INFO L278 IsEmpty]: Start isEmpty. Operand 19806 states and 62170 transitions. [2025-04-13 22:03:36,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:03:36,157 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:03:36,157 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:03:36,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 22:03:36,157 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:03:36,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:03:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1309275786, now seen corresponding path program 14 times [2025-04-13 22:03:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:03:36,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317160614] [2025-04-13 22:03:36,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:03:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:03:36,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:03:36,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:03:36,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:03:36,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:03:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:03:37,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:03:37,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317160614] [2025-04-13 22:03:37,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317160614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:03:37,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:03:37,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:03:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585271917] [2025-04-13 22:03:37,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:03:37,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:03:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:37,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:03:37,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:03:37,958 INFO L87 Difference]: Start difference. First operand 19806 states and 62170 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:41,851 INFO L93 Difference]: Finished difference Result 35490 states and 111275 transitions. [2025-04-13 22:03:41,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:03:41,851 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:41,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:42,646 INFO L225 Difference]: With dead ends: 35490 [2025-04-13 22:03:42,646 INFO L226 Difference]: Without dead ends: 20800 [2025-04-13 22:03:42,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:03:42,675 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3916 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:42,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3916 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 22:03:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20800 states. [2025-04-13 22:03:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20800 to 19776. [2025-04-13 22:03:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19776 states, 19759 states have (on average 3.142365504327142) internal successors, (62090), 19775 states have internal predecessors, (62090), 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 22:03:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19776 states to 19776 states and 62090 transitions. [2025-04-13 22:03:43,833 INFO L79 Accepts]: Start accepts. Automaton has 19776 states and 62090 transitions. Word has length 40 [2025-04-13 22:03:43,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:03:43,833 INFO L485 AbstractCegarLoop]: Abstraction has 19776 states and 62090 transitions. [2025-04-13 22:03:43,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:43,834 INFO L278 IsEmpty]: Start isEmpty. Operand 19776 states and 62090 transitions. [2025-04-13 22:03:43,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:03:43,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:03:43,839 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:03:43,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 22:03:43,839 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:03:43,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:03:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash 875606560, now seen corresponding path program 18 times [2025-04-13 22:03:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:03:43,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131801462] [2025-04-13 22:03:43,839 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:03:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:03:44,102 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:03:44,121 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:03:44,121 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:03:44,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:03:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:03:45,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:03:45,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131801462] [2025-04-13 22:03:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131801462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:03:45,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:03:45,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:03:45,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860955016] [2025-04-13 22:03:45,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:03:45,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:03:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:45,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:03:45,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:03:45,696 INFO L87 Difference]: Start difference. First operand 19776 states and 62090 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:50,201 INFO L93 Difference]: Finished difference Result 36302 states and 113808 transitions. [2025-04-13 22:03:50,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:03:50,201 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:50,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:51,138 INFO L225 Difference]: With dead ends: 36302 [2025-04-13 22:03:51,138 INFO L226 Difference]: Without dead ends: 21172 [2025-04-13 22:03:51,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:03:51,170 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4605 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 4605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:51,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 4665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 4605 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 22:03:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21172 states. [2025-04-13 22:03:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21172 to 19790. [2025-04-13 22:03:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19790 states, 19773 states have (on average 3.142062408334598) internal successors, (62128), 19789 states have internal predecessors, (62128), 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 22:03:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19790 states to 19790 states and 62128 transitions. [2025-04-13 22:03:52,452 INFO L79 Accepts]: Start accepts. Automaton has 19790 states and 62128 transitions. Word has length 40 [2025-04-13 22:03:52,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:03:52,452 INFO L485 AbstractCegarLoop]: Abstraction has 19790 states and 62128 transitions. [2025-04-13 22:03:52,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:52,452 INFO L278 IsEmpty]: Start isEmpty. Operand 19790 states and 62128 transitions. [2025-04-13 22:03:52,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:03:52,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:03:52,458 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:03:52,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 22:03:52,458 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:03:52,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:03:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash -397134766, now seen corresponding path program 19 times [2025-04-13 22:03:52,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:03:52,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816501372] [2025-04-13 22:03:52,458 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:03:52,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:03:52,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:03:52,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:03:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:03:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:03:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:03:54,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:03:54,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816501372] [2025-04-13 22:03:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816501372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:03:54,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:03:54,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:03:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282331956] [2025-04-13 22:03:54,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:03:54,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:03:54,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:54,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:03:54,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:03:54,378 INFO L87 Difference]: Start difference. First operand 19790 states and 62128 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:03:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:03:58,349 INFO L93 Difference]: Finished difference Result 35544 states and 111499 transitions. [2025-04-13 22:03:58,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:03:58,349 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:03:58,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:03:59,193 INFO L225 Difference]: With dead ends: 35544 [2025-04-13 22:03:59,193 INFO L226 Difference]: Without dead ends: 20922 [2025-04-13 22:03:59,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:03:59,221 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:03:59,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 4312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4257 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 22:03:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20922 states. [2025-04-13 22:03:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20922 to 19766. [2025-04-13 22:03:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19766 states, 19749 states have (on average 3.1426401336776544) internal successors, (62064), 19765 states have internal predecessors, (62064), 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 22:03:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19766 states to 19766 states and 62064 transitions. [2025-04-13 22:04:00,415 INFO L79 Accepts]: Start accepts. Automaton has 19766 states and 62064 transitions. Word has length 40 [2025-04-13 22:04:00,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:04:00,415 INFO L485 AbstractCegarLoop]: Abstraction has 19766 states and 62064 transitions. [2025-04-13 22:04:00,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:00,415 INFO L278 IsEmpty]: Start isEmpty. Operand 19766 states and 62064 transitions. [2025-04-13 22:04:00,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:04:00,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:04:00,421 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:04:00,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 22:04:00,421 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:04:00,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:04:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1952464026, now seen corresponding path program 20 times [2025-04-13 22:04:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:04:00,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081660639] [2025-04-13 22:04:00,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:04:00,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:04:00,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:04:00,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:04:00,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:04:00,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:04:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:04:02,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:04:02,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081660639] [2025-04-13 22:04:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081660639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:04:02,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:04:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:04:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346456191] [2025-04-13 22:04:02,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:04:02,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:04:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:04:02,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:04:02,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:04:02,203 INFO L87 Difference]: Start difference. First operand 19766 states and 62064 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:04:06,358 INFO L93 Difference]: Finished difference Result 36280 states and 113837 transitions. [2025-04-13 22:04:06,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:04:06,358 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:04:06,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:04:07,343 INFO L225 Difference]: With dead ends: 36280 [2025-04-13 22:04:07,344 INFO L226 Difference]: Without dead ends: 21118 [2025-04-13 22:04:07,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:04:07,385 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4294 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:04:07,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 4343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4294 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 22:04:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21118 states. [2025-04-13 22:04:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21118 to 19752. [2025-04-13 22:04:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19752 states, 19735 states have (on average 3.1429440081074236) internal successors, (62026), 19751 states have internal predecessors, (62026), 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 22:04:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19752 states to 19752 states and 62026 transitions. [2025-04-13 22:04:08,545 INFO L79 Accepts]: Start accepts. Automaton has 19752 states and 62026 transitions. Word has length 40 [2025-04-13 22:04:08,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:04:08,545 INFO L485 AbstractCegarLoop]: Abstraction has 19752 states and 62026 transitions. [2025-04-13 22:04:08,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:08,545 INFO L278 IsEmpty]: Start isEmpty. Operand 19752 states and 62026 transitions. [2025-04-13 22:04:08,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:04:08,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:04:08,550 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:04:08,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 22:04:08,551 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:04:08,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:04:08,551 INFO L85 PathProgramCache]: Analyzing trace with hash 679722700, now seen corresponding path program 21 times [2025-04-13 22:04:08,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:04:08,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961217050] [2025-04-13 22:04:08,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:04:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:04:08,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 22:04:08,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 22:04:08,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:04:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:04:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:04:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:04:10,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961217050] [2025-04-13 22:04:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961217050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:04:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:04:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-13 22:04:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439885661] [2025-04-13 22:04:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:04:10,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:04:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:04:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:04:10,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:04:10,518 INFO L87 Difference]: Start difference. First operand 19752 states and 62026 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:04:15,742 INFO L93 Difference]: Finished difference Result 36373 states and 114079 transitions. [2025-04-13 22:04:15,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:04:15,743 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:04:15,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:04:16,654 INFO L225 Difference]: With dead ends: 36373 [2025-04-13 22:04:16,654 INFO L226 Difference]: Without dead ends: 21223 [2025-04-13 22:04:16,699 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:04:16,700 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 315 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5385 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 5385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:04:16,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 0 Invalid, 5485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 5385 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 22:04:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21223 states. [2025-04-13 22:04:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21223 to 19405. [2025-04-13 22:04:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19405 states, 19388 states have (on average 3.1430781926965135) internal successors, (60938), 19404 states have internal predecessors, (60938), 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 22:04:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19405 states to 19405 states and 60938 transitions. [2025-04-13 22:04:17,962 INFO L79 Accepts]: Start accepts. Automaton has 19405 states and 60938 transitions. Word has length 40 [2025-04-13 22:04:17,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:04:17,963 INFO L485 AbstractCegarLoop]: Abstraction has 19405 states and 60938 transitions. [2025-04-13 22:04:17,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:17,963 INFO L278 IsEmpty]: Start isEmpty. Operand 19405 states and 60938 transitions. [2025-04-13 22:04:17,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:04:17,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:04:17,968 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:04:17,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 22:04:17,968 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:04:17,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:04:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2053395376, now seen corresponding path program 22 times [2025-04-13 22:04:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:04:17,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418677298] [2025-04-13 22:04:17,968 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:04:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:04:18,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:04:18,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:04:18,026 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:04:18,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:04:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:04:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:04:19,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418677298] [2025-04-13 22:04:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418677298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:04:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:04:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 22:04:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093829487] [2025-04-13 22:04:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:04:19,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:04:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:04:19,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:04:19,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:04:19,878 INFO L87 Difference]: Start difference. First operand 19405 states and 60938 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:04:25,474 INFO L93 Difference]: Finished difference Result 35170 states and 110266 transitions. [2025-04-13 22:04:25,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:04:25,474 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:04:25,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:04:26,367 INFO L225 Difference]: With dead ends: 35170 [2025-04-13 22:04:26,367 INFO L226 Difference]: Without dead ends: 20743 [2025-04-13 22:04:26,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:04:26,400 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5486 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 5486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:04:26,400 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 5560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 5486 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-04-13 22:04:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2025-04-13 22:04:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 19309. [2025-04-13 22:04:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19309 states, 19292 states have (on average 3.1454488907319096) internal successors, (60682), 19308 states have internal predecessors, (60682), 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 22:04:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19309 states to 19309 states and 60682 transitions. [2025-04-13 22:04:27,591 INFO L79 Accepts]: Start accepts. Automaton has 19309 states and 60682 transitions. Word has length 40 [2025-04-13 22:04:27,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:04:27,591 INFO L485 AbstractCegarLoop]: Abstraction has 19309 states and 60682 transitions. [2025-04-13 22:04:27,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:27,591 INFO L278 IsEmpty]: Start isEmpty. Operand 19309 states and 60682 transitions. [2025-04-13 22:04:27,596 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:04:27,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:04:27,597 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:04:27,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 22:04:27,597 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 22:04:27,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:04:27,597 INFO L85 PathProgramCache]: Analyzing trace with hash 35963622, now seen corresponding path program 1 times [2025-04-13 22:04:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:04:27,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23718732] [2025-04-13 22:04:27,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:04:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:04:27,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:04:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:04:27,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:04:27,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2025-04-13 22:04:27,893 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 22:04:27,895 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 22:04:27,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 22:04:27,895 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 4,while InterpolatingTraceCheckCraig was while computing interpolants. [2025-04-13 22:04:27,895 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 22:04:27,895 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 22:04:27,895 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 22:04:27,895 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 22:04:27,895 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-04-13 22:04:27,895 INFO L422 BasicCegarLoop]: Path program histogram: [34, 22, 15, 14, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:04:27,897 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-13 22:04:27,897 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:04:27,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:04:27 BasicIcfg [2025-04-13 22:04:27,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:04:27,900 INFO L158 Benchmark]: Toolchain (without parser) took 794393.36ms. Allocated memory was 142.6MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 97.1MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-13 22:04:27,900 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 83.5MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:04:27,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 759.62ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 34.1MB in the end (delta: 63.0MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2025-04-13 22:04:27,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.90ms. Allocated memory is still 142.6MB. Free memory was 34.1MB in the beginning and 93.1MB in the end (delta: -59.0MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2025-04-13 22:04:27,900 INFO L158 Benchmark]: Boogie Preprocessor took 167.60ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 79.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:04:27,900 INFO L158 Benchmark]: IcfgBuilder took 3212.85ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 79.5MB in the beginning and 176.6MB in the end (delta: -97.2MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. [2025-04-13 22:04:27,901 INFO L158 Benchmark]: TraceAbstraction took 790132.85ms. Allocated memory was 343.9MB in the beginning and 6.5GB in the end (delta: 6.2GB). Free memory was 176.6MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 22:04:27,901 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.25ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 83.5MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 759.62ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 34.1MB in the end (delta: 63.0MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 115.90ms. Allocated memory is still 142.6MB. Free memory was 34.1MB in the beginning and 93.1MB in the end (delta: -59.0MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 167.60ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 79.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgBuilder took 3212.85ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 79.5MB in the beginning and 176.6MB in the end (delta: -97.2MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. * TraceAbstraction took 790132.85ms. Allocated memory was 343.9MB in the beginning and 6.5GB in the end (delta: 6.2GB). Free memory was 176.6MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 2.7GB. 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 - 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: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 4,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 1793]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 4,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 4,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 4,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 4,while InterpolatingTraceCheckCraig was while computing interpolants. - TimeoutResultAtElement [Line: 1952]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 4,while InterpolatingTraceCheckCraig was while computing interpolants. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 180 locations, 256 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354 IncrementalHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 3 mSDtfsCounter, 354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2401occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 55 SizeOfPredicates, 0 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 196 locations, 278 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 787.5s, OverallIterations: 101, TraceHistogramMax: 4, PathProgramHistogramMax: 34, EmptinessCheckTime: 0.6s, AutomataDifference: 499.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30526 SdHoareTripleChecker+Valid, 385.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30526 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 351.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 6907 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455651 IncrementalHoareTripleChecker+Invalid, 462558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6907 mSolverCounterUnsat, 3 mSDtfsCounter, 455651 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2989 GetRequests, 299 SyntacticMatches, 7 SemanticMatches, 2683 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19686 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73556occurred in iteration=6, InterpolantAutomatonStates: 2401, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.7s AutomataMinimizationTime, 100 MinimizatonAttempts, 271384 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 185.6s InterpolantComputationTime, 3864 NumberOfCodeBlocks, 3676 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 3774 ConstructedInterpolants, 0 QuantifiedInterpolants, 59734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 102 InterpolantComputations, 99 PerfectInterpolantSequences, 970/973 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